Did you compare JTS 1.11 Delaunay triangulation code to Jonathan Shewchuk's
Triangle library ( http://www.cs.cmu.edu/~quake/triangle.html ) in terms of
robustness and efficiency?
If you didn't or if it's more efficient, I wouldn't mind having an
opportunity to do some tests.
Thanks,
Julien
2009/4
Great...
Not publicly available yet, but very soon I'll post when it is.
Christopher wrote:
> It should be quite easy to plug in your new DT algorithms into my TIN module;
> I designed the DT part to be a plugable as possible. When I have a chance,
> I'll take the new DT for a spin.
>
> Is
In the code inside my previous post I used the value "this" as a flag
but maybe that was bad!!! That way the BasicFeature could live forever,
or maybe not if garbage collectors are smarter these days...???
Anyway the point was to use a reference to any already existing Object
as a flag, so to n
It should be quite easy to plug in your new DT algorithms into my TIN module; I
designed the DT part to be a plugable as possible. When I have a chance, I'll
take the new DT for a spin.
Is the JTS 1.11 code on a public repository?
--Christopher
--- On Tue, 4/28/09, Martin Davis wrote:
> Fr
Good job done!!!
But what if the initial value for a certain attribute was indeed NULL???
Data coming from a database can contain NULLs...
I thought about this problem, but to me there's no way for a Feature to
reliably know when it's initialization ends.
Maybe client code, for its own purposes,
Sure. I'll work on getting a new release together and send it to you
off-list.
Sunburned Surveyor wrote:
> I wouldn't mind getting a preview of the code. If you don't have any
> objections, I think we should also share it with Christopher, our
> student that is working in JTIN.
>
> Thanks,
>
> S
Good one Larry! That seems like a perfect solution...
Larry Becker wrote:
> OK, it turns out there is a way to implement BasicFeatue.isModified()
> with a simple boolean. All you need to do is add a check for null as in:
>
> public void setAttribute(int attributeIndex, Object newAttribute)
I wouldn't mind getting a preview of the code. If you don't have any
objections, I think we should also share it with Christopher, our
student that is working in JTIN.
Thanks,
SS
On Tue, Apr 28, 2009 at 11:16 AM, Martin Davis wrote:
> Yes, there's also a ConformalDelaunayTriangulation API inclu
Yes, there's also a ConformalDelaunayTriangulation API included.
It provides a conformal Delaunay, as opposed to a constrained Delaunay,
so it depends on exactly what you're looking for.
M
Sunburned Surveyor wrote:
> Martin,
>
> Any chance the JTS triangulation code allows you to constrain a T
Martin,
Any chance the JTS triangulation code allows you to constrain a TIN
with breaklines and boundaries? That is something I wanted to include
in JTin at one point in the future.
The Sunburned Surveyor
On Tue, Apr 28, 2009 at 8:58 AM, Martin Davis wrote:
> Some might be interested to know th
Some might be interested to know that the JTS 1.11 will contain code for
building Delaunay triangulations. The code is quite robust and is very
fast.
It might be interesting to compare this to the code in the OpenJUMP JTin
API and see if there's any advantage to using one or the other.
I al
Larry,
I wanted to get back to you yesterday, and I got bery busy at work. I
don't personally have a problem with you commiting your changes to the
BasicFeature class. We can start testing the change in our nightly
build, and will be able to get an idea on how serious the memory
impact is. In the
12 matches
Mail list logo
