Paul wrote: "Just from my quick read of the streaming approach it
looks like it's
still using the same algorithm to generate the triangles themselves as
it is just doing it within a specified region. So if we start with
producing a robust TIN generator then we can plug that into any of the
other ap
Streaming is always a preferred way of doing things, as is dividing work
into regions. If you have the source data in a database then you can
easily divide the data into a rectangular grid and process each cell in
the grid separately and then do some seeming on the edges as post
processing. I'v
Chris,
You wrote: "We really should seriously consider a streaming model
for the TIN library. If this library is intended to be
decoupled from OpenJUMP and used in multiple JavaGIS
projects, then dealing with huge data sets that dwarf
available RAM would be a very big plus."
I agree with this %10
Hei
just look for the Create Thiessen Polygons Plugin (under tools/generate/)
..the best trick is to search in the jump.properties file for the string
that is used in the menu names
stefan
Christopher schrieb:
>
>
> --- Stefan Steiniger <[EMAIL PROTECTED]> wrote:
>> b) I have also uses some
--- Stefan Steiniger <[EMAIL PROTECTED]> wrote:
> b) I have also uses some triangulation code by Paul
> Chew for the
> Thiessen-polygon algorithm. Unfortunately this
> algorithm is based on a
> simplex-insert method, which is advantageous for
> streaming but not
> necessary if all points are
TIN people,
I think you should continue to work from the base of Paul's code. The
Waterbug code is based on the Quadedge data structure. I think it would
be cleaner to use a Triangle-based data structure, like Paul's does.
For Constrained Delaunay, have a look at Triangle by Jonathan Shewchuc
just another lib to look on, although it is written in C. But lots of
experts in Comp. Geom. worked on it
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/packages.html#Part:TriangulationsAndDelaunayTriangulations
-
Chec
Hei.. as I did try some bugfixing yesterday on the Warping Bug I want to
give two notes (sorry I still do not have read all the emails of this
topic):
a) The Warping code (see WarpPanel) also uses a Triangle.class. But I
think this is only a 2-D triangle
b) I have also uses some triangulation
As Landon mentioned, the only limit is the amount of RAM a user has
given to the virtual machine.
There are however some smart things we can do to reduce the memory usage.
For example within the TIN itself use highly efficient data structures,
such as defining a triangle object with 3 coordinat
Basically the limit is based on the RAM of your computer. This is
because OpenJUMP stores each feature in memory. This makes for fast
rendering, but imposes an upper limit on the number of features you
can work with at any one time.
The Sunburned Surveyor
On Mon, Mar 31, 2008 at 6:18 PM, Christop
--- Stefan Steiniger <[EMAIL PROTECTED]> wrote:
> I send you the slides in an extra email,
>
> about the code we need to ask Martin. I am actually
> not sure how much of
> the stuff he did within postgis, due to the memory
> limitations of JUMP.
Thanks for the slides.
What are the memory limi
I send you the slides in an extra email,
about the code we need to ask Martin. I am actually not sure how much of
the stuff he did within postgis, due to the memory limitations of JUMP.
Stefan
-
Check out the new SourceForg
I'm sure a code release could be arranged with Martin.
SS
On Mon, Mar 31, 2008 at 2:03 PM, Christopher <[EMAIL PROTECTED]> wrote:
> The slides would be great. Did he release any sample
> code under the L/GPL?
>
> --Christopher
>
>
> --- Stefan Steiniger <[EMAIL PROTECTED]> wrote:
>
> > Hei Guys,
The slides would be great. Did he release any sample
code under the L/GPL?
--Christopher
--- Stefan Steiniger <[EMAIL PROTECTED]> wrote:
> Hei Guys,
>
> sorry for not having a look on this topic so far.
> But one thing may be
> to include Martin David' expertise in this
> discussion since he
Hei Guys,
sorry for not having a look on this topic so far. But one thing may be
to include Martin David' expertise in this discussion since he presented
on last FOSS4G:
http://lin-ear-th-inking.blogspot.com/2007/05/geotec-2007-presentation-on-watershed.html
I also have the slides.
Stefan
Pa
Paul,
Thanks for welcoming Chris and getting involved. I hope to respond to
his e-mail, but I won't get to it tomorrow. I have the feeling Chris
will be a great addition to our team. His programming experience is
was more extensive than my own.
The Sunburned Surveyor
On Mon, Mar 31, 2008 at 10:5
Christopher,
Here is some code I started to create a TIN API.
http://rsiaf.googlecode.com/svn/rs-gis-core/trunk/src/main/java/com/revolsys/gis/tin/
It works well for the case where you just have DEM points but there are
some issues when you start introducing breaklines. The problems come
down
--- Paul Austin <[EMAIL PROTECTED]> wrote:
> Christopher,
>
> Welcome aboard, glad to see someone working on this.
>
> I'm going to write a longer email later but one of
> the things we should
> consider is splitting the model and operations for
> the TIN itself from
> the visualization and IO
Christopher,
Welcome aboard, glad to see someone working on this.
I'm going to write a longer email later but one of the things we should
consider is splitting the model and operations for the TIN itself from
the visualization and IO code. So the TIN model should not be dependent
on anything
Following is an interleaved reply...
--- Landon Blake <[EMAIL PROTECTED]> wrote:
> Before I respond to your comments, let me ask you a
> question:
> Did you turn in your student application yet?
Yes I have.
> You wrote: " I planning on first writing code that
> can read, write
> and display TI
20 matches
Mail list logo