No, I don't use this technique. It looks pretty complicated! And I
have never seen any implementation examples on the web (which is the
case for 90% of the papers out there, of course).
For predicates I use the technique of exact determinant sign evaluation
by Devillers et al. For robustness of line arrangment computation I use
a snap-rounding approach (see Hobby and others).
M
Michael Bedward wrote:
2009/3/18 Martin Davis mbda...@refractions.net:
So it doesn't need debugging - it needs some brilliant new thinking!
Sounds like what I think about most of my code...
Out of interest Martin, do you use anything like the approach described here...
Edelsbrunner Mucke (1990) Simulation of simplicity: a technique to
cope with degenerate cases in geometric algorithms.
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.5997
I've been trying to understand it.
Michael
___
jts-devel mailing list
jts-devel@lists.jump-project.org
http://lists.refractions.net/mailman/listinfo/jts-devel
--
Martin Davis
Senior Technical Architect
Refractions Research, Inc.
(250) 383-3022
___
jts-devel mailing list
jts-devel@lists.jump-project.org
http://lists.refractions.net/mailman/listinfo/jts-devel
