Toward superrobust geometric computation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Toward superrobust geometric computation

Full text

Pdf (115 KB)

Source

ACM Symposium on Solid and Physical Modeling archive
Proceedings of the 2008 ACM symposium on Solid and physical modeling table of contents

Stony Brook, New York

SESSION: Invited talks table of contents

Pages 11-12

Year of Publication: 2008

ISBN:978-1-60558-106-2

Author

Kokichi Sugihara

University of Tokyo

Sponsor

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 52, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

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/1364901.1364905 What is a DOI?

ABSTRACT

To make geometric computation robust against numerical errors is one of the most important issues for practical applications of geometric algorithms. We first review existing approaches to robust geometric computation, and next show that there still remain many difficulties. Finally we discuss possible directions to overcome these difficulties and thus to achieve superrobustness.

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	Kurt Mehlhorn , Stefan Näher, LEDA: a platform for combinatorial and geometric computing, Cambridge University Press, New York, NY, 1999
	2	K. Sugihara , M. Iri, A solid modelling system free from topological inconsistency, Journal of Information Processing, v.12 n.4, p.380-393, 1989
	3	Sugihara, K., and Iri, M. 1992. Construction of the voronoi diagram for one million generators in single-precision arithmetic. Proceedings of the IEEE 80, 9, 1471--1484.
	4	Sugihara, K. 1999. Resolvable representation of polyhedra. Discrete and Computational Geometry 21, 243--255.
	5	Kokichi Sugihara, Sliver-free perturbation for the Delaunay tetrahedrization, Computer-Aided Design, v.39 n.2, p.87-94, February, 2007 [doi>10.1016/j.cad.2006.10.002]
	6	Chee-Keng Yap, Towards exact geometric computation, Computational Geometry: Theory and Applications, v.7 n.1-2, p.3-23, Jan. 1997 [doi>10.1016/0925-7721(95)00040-2]