Rounding arrangements dynamically

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Rounding arrangements dynamically

Full text

Pdf (1.12 MB)

Source

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

Vancouver, British Columbia, Canada

Pages: 190 - 199

Year of Publication: 1995

ISBN:0-89791-724-3

Authors

Leonidas J. Guibas	Xerox Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Alto, Calif. and Department of Computer Science, Stanford University, Stanford, Calif.
David H. Marimont	Department of Computer Science, Stanford University, Stanford, Calif.

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): 3, Downloads (12 Months): 13, Citation Count: 12

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/220279.220300 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	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	Bernard Chazelle , Herbert Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, Journal of the ACM (JACM), v.39 n.1, p.1-54, Jan. 1992 [doi>10.1145/147508.147511]
	3	K. L. Clarkson , P. W. Shor, Applications of random sampling in computational geometry, II, Discrete & Computational Geometry, v.4 n.5, p.387-421, 1989 [doi>10.1007/BF02187740]
	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	Steven Fortune , Victor Milenkovic, Numerical stability of algorithms for line arrangements, Proceedings of the seventh annual symposium on Computational geometry, p.334-341, June 10-12, 1991, North Conway, New Hampshire, United States [doi>10.1145/109648.109685]
	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. M. Hoffmann , J. E. Hopcroft , M. S. Karasick, Towards implementing robust geometric computations, Proceedings of the fourth annual symposium on Computational geometry, p.106-117, June 06-08, 1988, Urbana-Champaign, Illinois, United States [doi>10.1145/73393.73405]
	10	J. Matou~ek, "Geometric range searching," Technical Report B-93- 09, Fachbereich Mathematik und Informatik, Free Univ. Berlin, 1993.
	11	Victor Joseph Milenkovic, Verifiable implementations of geometric algorithms using finite precision arithmetic, 1988
	12	K. Mulmuley, A fast planar partition algorithm, I, Journal of Symbolic Computation, v.10 n.3-4, p.253-280, Sept./Oct. 1990 [doi>10.1016/S0747-7171(08)80064-8]
	13	Ketan Mulmuley, Computational Geometr3,: An Introduction Through Randomized Algorithms, Prentice Hall (Englewood Cliffs, NJ), 1994.
	14	D. Salesin , J Stolfi , L. Guibas, Epsilon geometry: building robust algorithms from imprecise computations, Proceedings of the fifth annual symposium on Computational geometry, p.208-217, June 05-07, 1989, Saarbruchen, West Germany [doi>10.1145/73833.73857]
	15	K. Sugihara and M. Iri, Geometric Algorithms in finite-precision arithmetic, Research Memorandum RM188-10, University of Tokyo, September 1988.

CITED BY 12

	Gill Barequet , Stina S. Bridgeman , Christian A. Duncan , Michael T. Goodrich , Roberto Tamassia, Classical computational geometry in GeomNet, Proceedings of the thirteenth annual symposium on Computational geometry, p.412-414, June 04-06, 1997, Nice, France
	Victor J. Milenkovic, Rotational polygon containment and minimum enclosure, Proceedings of the fourteenth annual symposium on Computational geometry, p.1-8, June 07-10, 1998, Minneapolis, Minnesota, United States
	Siu-Wing Cheng , Herbert Edelsbrunner , Ping Fu , Ka-Po Lam, Design and analysis of planar shape deformation, Proceedings of the fourteenth annual symposium on Computational geometry, p.29-38, June 07-10, 1998, Minneapolis, Minnesota, United States
	Michael T. Goodrich , Leonidas J. Guibas , John Hershberger , Paul J. Tanenbaum, Snap rounding line segments efficiently in two and three dimensions, Proceedings of the thirteenth annual symposium on Computational geometry, p.284-293, June 04-06, 1997, Nice, France
	Simon Kahan , Jack Snoeyink, On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time, Proceedings of the twelfth annual symposium on Computational geometry, p.151-158, May 24-26, 1996, Philadelphia, Pennsylvania, United States
	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
	Olivier Devillers , Pierre-Marie Gandoin, Rounding voronoi diagram, Theoretical Computer Science, v.283 n.1, p.203-221, June 11 2002
	Mark Pauly , Richard Keiser , Bart Adams , Philip Dutré , Markus Gross , Leonidas J. Guibas, Meshless animation of fracturing solids, ACM Transactions on Graphics (TOG), v.24 n.3, July 2005
	Werner Hölbling , Werner Kuhn , Andrew U. Frank, Finite-Resolution Simplicial Complexes, Geoinformatica, v.2 n.3, p.281-298, October 1998
	John Hershberger, Improved output-sensitive snap rounding, Proceedings of the twenty-second annual symposium on Computational geometry, June 05-07, 2006, Sedona, Arizona, USA
	Jose Antonio Cotelo Lema , Ralf Hartmut Güting, Dual Grid: A New Approach for Robust Spatial Algebra Implementation, Geoinformatica, v.6 n.1, p.57-76, March 2002
	Edmund Burke , Robert Hellier , Graham Kendall , Glenn Whitwell, A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem, Operations Research, v.54 n.3, p.587-601, May-June 2006