Resolvable representation of polyhedra

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Resolvable representation of polyhedra

Full text

Pdf (815 KB)

Source

ACM Symposium on Solid and Physical Modeling archive
Proceedings on the second ACM symposium on Solid modeling and applications table of contents

Montreal, Quebec, Canada

Pages: 127 - 135

Year of Publication: 1993

ISBN:0-89791-584-4

Author

Kokichi Sugihara

Sponsor

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): 6, Citation Count: 2

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/164360.164406 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	Christoph M. Hoffmann, The Problems of Accuracy and Robustness in Geometric Computation, Computer, v.22 n.3, p.31-40, March 1989 [doi>10.1109/2.16223]
	2	Christoph M. Hoffmann, Geometric and solid modeling: an introduction, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1989
	3	D. H. Greene and F. Yao: Finite-resolution computational geometry. Proceedings of the 27th IEEE Annual Symposium on Foundations of Computer Science, Toronto, 1986, pp. 143-152.
	4	Victor J. Milenkovic, Verifiable implementation of geometric algorithms using finite precision arithmetic, Artificial Intelligence, v.37 n.1-3, p.377-401, Dec. 1988 [doi>10.1016/0004-3702(88)90061-6]
	5	S. Fortune: Stable maintenance of point-set triangulations in two dimensions. Proceedings of the 30th IEEE Annual Symposium on Foundations of Computer Science, Research Triangle Park, 1989, pp. 494-499.
	6	K. Sugihara , M. Iri, A solid modelling system free from topological inconsistency, Journal of Information Processing, v.12 n.4, p.380-393, 1989
	7	John E. Hopcroft , Peter J. Kahn, A Paradigm for Robust Geometric Algorithms, Cornell University, Ithaca, NY, 1989
	8	K. Sugihara and M. Iri: Construction of the Voronoi diagram for "one million" generators in single-precision arithmetic. Proceedings of the IEEE, vol. 80, no. 9, (September 1992), pp. 1471-1484.
	9	M. M~intyl~: An Introduction to Sohd Modeling. Computer Science Press, Rockville, Maryland, 1988.
	10	Kokichi Sugihara, Machine interpretation of line drawings, MIT Press, Cambridge, MA, 1986
	11	E. $teinitz: Polyeder und Raumeinteilungen. Encyklop~idie der mathematischen Wissenschaften, Band III, Teil 1, 2. H~Ifte, IIIAB12, pp. 1-139, 1916.
	12	L. A. Lyusternik (T. J. Smith, trans.): Conve~. Figures and Polyhedra. Dover, New York, 1963.

CITED BY 2

	Masatake Higashi , Hisashi Nakano , Atsuhide Nakamura , Mamoru Hosaka, Use of topological constraints in construction and processing of robust solid models, Proceedings of the sixth ACM symposium on Solid modeling and applications, p.18-29, May 2001, Ann Arbor, Michigan, United States
	Alexey Lvov , Ulrich Finkler, Exact basic geometric operations on arbitrary angle polygons using only fixed size integer coordinates, Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design, November 10-13, 2008, San Jose, California