Rounding arrangements dynamically

Proceedings of the Annual Symposium on Computational Geometry

Volumn Part F129372, Issue , 1995, Pages 190-199

  Guibas, Leonidas J ^a,b   Marimont, David H ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CELL DECOMPOSITION; DYNAMIC ALGORITHM; LINE SEGMENT; LOCATING POINTS; SET OF LINES;

COMPUTATIONAL GEOMETRY;

EID: 0001744010     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/220279.220300     Document Type: Conference Paper

References (15)

1. J. L. Bentley and T. A. Ottmann, "Algorithms for reporting and counting geometric intersections", IEEE Trans. Comput., v. C-28, pp. 643-647, 1979.
2. B. Chazelle and H. Edelsbrunner, "An optimal algorithm for intersecting line segments in the plane", J. Assoc. Comput. Mach., v. 39, pp. 1-54, 1992.
3. K. Clarkson and P. Shor, "Applications of random sampling in computational geometry II", Discrete Comput. Geom., v. 4, pp. 387-421, 1989.
4. S. Fortune, "Stable maintenance of point-set triangulation in two dimensions", unpublished manuscript, AT&T Bell Laboratories. (An abbreviated version appeared in Proc. 30h Ann. Symp. on Foundations of Computer Science, pp. 494-499, 1989.)
5. S. Fortune and v. Milenkovic, "Numerical stability of algorithms for line arrangements", Proc. Seventh Ann. Symp. on Computational Geometry, pp. 334-341, 1991.
6. Daniel H. Greene, "Integer Line Segment Intersection", unpublished manuscript.
7. Daniel H. Greene and Frances F. Yao, "Finite-Resolution Computational Geometry", Proc. 27th Ann. Symp. on Foundations of Computer Science, pp. 143-152, 1986.
8. John D. Hobby, "Practical Segment Intersection with Finite Precision Output", submitted for publication.
9. C. Hoffman, J. Hopcroft, and M. Karasick, "Towards implementing robust geometric computation", Proc. Fourth Ann. Symp. on Computational Geometry, pp. 106-117, 1988.
10. J. Matoušek, "Geometric range searching", Technical Report B-93-09, Fachbereich Mathematik und Informatik, Free Univ. Berlin, 1993.
11. v. Milenkovic, Verifiable Implementations of Geometrie Algorithms using Finite Precision Arithmetic, Ph. D. Thesis, Carnegie-Mellon, 1988. Also Technical Report CMU-CS-88-168, Carnegie Mellon University, 1988.
12. Ketan Mulmuley, "A fast planar partition algorithm I", J. Symbolic Comput., v. 10, pp. 253-280, 1990.
13. Ketan Mulmuley, Computational Geometry: An Introduction Through Randomized Algorithms, Prentice Hall (Englewood Cliffs, NJ), 1994.
14. L. Guibas, D. Salesin, and J. Stolfi, "Epsilon Geometry: building robust algorithms from imprecise calculations", Proc. Fifth Ann. Symp. on Computational Geometry, pp. 208-217, 1989.
15. K. Sugihara and M. Iri, Geometric Algorithms in finite-precision arithmetic, Research Memorandum RMI88-10, University of Tokyo, September 1988.