Look — a Lazy Object-Oriented Kernel for geometric computation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Look — a Lazy Object-Oriented Kernel for geometric computation

Full text

Pdf (1.02 MB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the sixteenth annual symposium on Computational geometry table of contents

Clear Water Bay, Kowloon, Hong Kong

Pages: 156 - 165

Year of Publication: 2000

ISBN:1-58113-224-7

Authors

Stefan Funke	Max-Planck-Institut für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany
Kurt Mehlhorn	Max-Planck-Institut für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 9, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/336154.336196 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Nina Amenta , Marshall Bern, Surface reconstruction by Voronoi filtering, Proceedings of the fourteenth annual symposium on Computational geometry, p.39-48, June 07-10, 1998, Minneapolis, Minnesota, United States [doi>10.1145/276884.276889]
	2	Jean-Daniel Boissonnat , Jack Snoeyink, Efficient algorithms for line and curve segment intersection using restricted predicates, Proceedings of the fifteenth annual symposium on Computational geometry, p.370-379, June 13-16, 1999, Miami Beach, Florida, United States [doi>10.1145/304893.304991]
	3	Hervé Brönnimann , Christoph Burnikel , Sylvain Pion, Interval arithmetic yields efficient dynamic filters for computational geometry, Proceedings of the fourteenth annual symposium on Computational geometry, p.165-174, June 07-10, 1998, Minneapolis, Minnesota, United States [doi>10.1145/276884.276903]
	4	The CGAL project ht tp: //www. cs. uu. nl/CGAL/
	5	C. Burnikel , R. Fleischer , K. Mehlhorn , S. Schirra, Efficient exact geometric computation made easy, Proceedings of the fifteenth annual symposium on Computational geometry, p.341-350, June 13-16, 1999, Miami Beach, Florida, United States [doi>10.1145/304893.304988]
	6	Christoph Burnikel , Stefan Funke , Michael Seel, Exact geometric predicates using cascaded computation, Proceedings of the fourteenth annual symposium on Computational geometry, p.175-183, June 07-10, 1998, Minneapolis, Minnesota, United States [doi>10.1145/276884.276904]
	7	Olivier Devillers , Franco P. Preparata, Further results on arithmetic filters for geometric predicates, Computational Geometry: Theory and Applications, v.13 n.2, p.141-148, June 1999 [doi>10.1016/S0925-7721(99)00011-5 ]
	8	R.A. Dwyer: A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations, (Algorithmica (1987), 2)
	9	Steven Fortune, Vertex-rounding a three-dimensional polyhedral subdivision, Proceedings of the fourteenth annual symposium on Computational geometry, p.116-125, June 07-10, 1998, Minneapolis, Minnesota, United States [doi>10.1145/276884.276897]
	10	Steven Fortune , Christopher J. Van Wyk, Static analysis yields efficient exact integer arithmetic for computational geometry, ACM Transactions on Graphics (TOG), v.15 n.3, p.223-248, July 1996 [doi>10.1145/231731.231735]
	11	S. Funke, K. Mehlhom, S.N/iher: Structural Filtering- A Paradigm for Efficient and Exact Geometric Programs, (Proeeedings of the 11 th Canadian Conference on CG 1999)
	12	IEEE standard 754-1985 for binaryfloating-point arithmetic, reprinted in SIGPLAN 22, 2:9-25, 1987
	13	Michael Karasick , Derek Lieber , Lee R. Nackman, Efficient Delaunay triangulation using rational arithmetic, ACM Transactions on Graphics (TOG), v.10 n.1, p.71-91, Jan. 1991 [doi>10.1145/99902.99905]
	14	The LEDA homepage http://www.mpi- sb.mpg.de/LEDA/
	15	Stefan Schirra, A Case Study on the Cost of Geometric Computing, Selected papers from the International Workshop on Algorithm Engineering and Experimentation, p.156-176, January 15-16, 1999
	16	C. K. Yap, T. Dube: The exact computation paradigm, (In D. Du and F. Hwang, editors, Computing in Euclidean Geometry, pages 452-492. World Scientific Press, 1995.2nd edition.)

CITED BY 5

	Olivier Devillers , Philippe Guigue, Inner and outer rounding of boolean operations on lattice polygonal regions, Computational Geometry: Theory and Applications, v.33 n.1-2, p.3-17, January 2006
	Aleksandar Nanevski , Guy Blelloch , Robert Harper, Automatic generation of staged geometric predicates, ACM SIGPLAN Notices, v.36 n.10, October 2001
	Olivier Devillers , Philippe Guigue, Inner and outer rounding of set operations on lattice polygonal regions, Proceedings of the twentieth annual symposium on Computational geometry, June 08-11, 2004, Brooklyn, New York, USA
	Olivier Devillers , Monique Teillaud, Perturbations and vertex removal in a 3D delaunay triangulation, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
	Aleksandar Nanevski , Guy Blelloch , Robert Harper, Automatic Generation of Staged Geometric Predicates, Higher-Order and Symbolic Computation, v.16 n.4, p.379-400, December 2003