Good orders for incremental (re)construction

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Good orders for incremental (re)construction

Full text

Pdf (531 KB)

Source

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

Nice, France

Pages: 400 - 402

Year of Publication: 1997

ISBN:0-89791-878-9

Authors

Jack Snoeyink	Dept. of Computer Science, University of British Columbia
Marc van Kreveld	Dept. of Computer Science, Utrecht University

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): 2, Downloads (12 Months): 23, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/262839.263025 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	Mark de Berg , Marc van Kreveld , Mark Overmars , Otfried Schwarzkopf, Computational geometry: algorithms and applications, Springer-Verlag New York, Inc., Secaucus, NJ, 1997
	2	Marshall W. Bern , Herbert Edelsbrunner , David Eppstein , Sandra L. Mitchell , Tio Seng Tan, Edge Insertion for Optional Triangulations, Proceedings of the 1st Latin American Symposium on Theoretical Informatics, p.46-60, April 06-10, 1992
	3	N. Chiba, T. Nishizeki, and N. Saito. A linear 5- coloring algorithm of planar graphs. Journal of Algorithms, 2:317-327, 1981.
	4	Michael Deering, Geometry compression, Proceedings of the 22nd annual conference on Computer graphics and interactive techniques, p.13-20, September 1995 [doi>10.1145/218380.218391]
	5	H. Djidjev and A. Lingas. On computing the Voronoi diagram for restricted planar figures. In WADS '91, LNCS 519, pages 54-64. Springer- Verlag, 1991.
	6	L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica, 7:381-413, 1992.
	7	Hugues Hoppe, Progressive meshes, Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, p.99-108, August 1996 [doi>10.1145/237170.237216]
	8	D. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing, 12:28-35, 1983.
	9	K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice- Hall, Englewood Cliffs, N.J., 1993.
	10	T. K. Peucker, R. J. Fowler, J. J. Little, and D. M. Mark. The triangulated irregular network. In Amer. Soc. Photogrammetry Proc. Digital Terrain Models Symposium, pages 516-532, 1978.
	11	Neil Robertson , Daniel P. Sanders , Paul Seymour , Robin Thomas, Efficiently four-coloring planar graphs, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.571-575, May 22-24, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237814.238005]
	12	R. Seidel. Backwards analysis of randomized geometric algorithms. In J. Pach, editor, New Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics, pages 37-68. Springer-Verlag, 1993.
	13	R. Seidel. A method for proving lower bounds for certain geometric problems. In G. T. Toussaint, editor, Computational Geometry, pages 319-334. North Holland, Amsterdam, 1985.

CITED BY 4

	Pierre Alliez , Mathieu Desbrun, Progressive compression for lossless transmission of triangle meshes, Proceedings of the 28th annual conference on Computer graphics and interactive techniques, p.195-202, August 2001
	Andrzej Szymczak , Jarek Rossignac, Grow & fold: compression of tetrahedral meshes, Proceedings of the fifth ACM symposium on Solid modeling and applications, p.54-64, June 08-11, 1999, Ann Arbor, Michigan, United States
	Jarek Rossignac, Edgebreaker: Connectivity Compression for Triangle Meshes, IEEE Transactions on Visualization and Computer Graphics, v.5 n.1, p.47-61, January 1999
	Renato Pajarola , Jarek Rossignac, Compressed Progressive Meshes, IEEE Transactions on Visualization and Computer Graphics, v.6 n.1, p.79-93, January 2000