Checking geometric programs or verification of geometric structures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Checking geometric programs or verification of geometric structures

Full text

Pdf (681 KB)

Source

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

Philadelphia, Pennsylvania, United States

Pages: 159 - 165

Year of Publication: 1996

ISBN:0-89791-804-5

Authors

Kurt Mehlhorn	Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany
Stefan Näher	Martin-Luther-Universität Halle, Fachbereich Mathematik und Informatik, 06099 Halle, Germany
Thomas Schilz	Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany
Stefan Schirra	Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany
Michael Seel	Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany
Raimund Seidel	Universität des Saarlandes, Fachbereich 14 Informatik, 66041 Saarbrücken, Germany
Christian Uhrig	Max-Planck-Institut für Informatik, 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): 5, Downloads (12 Months): 17, Citation Count: 5

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/237218.237344 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	C. Aragon and R. Seidel. Randomized search trees. In Proc. 30th Ann. IEEE Syrup. on Foundations of Computer Science, pages 540-545, 1989. To appear in Algorithmica.
	2	David Avis , David Bremner , Raimund Seidel, How good are convex hull algorithms?, Computational Geometry: Theory and Applications, v.7 n.5-6, p.265-301, April 1997 [doi>10.1016/S0925-7721(96)00023-5]
	3	M. Blum , S. Kanna, Designing programs that check their work, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.86-97, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73015]
	4	M. Blum , M. Luby , R. Rubinfeld, Self-testing/correcting with applications to numerical problems, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.73-83, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100225]
	5	Christoph Burnikel , Kurt Mehlhorn , Stefan Schirra, On degeneracy in geometric computations, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.16-23, January 23-25, 1994, Arlington, Virginia, United States
	6	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]
	7	Kenneth L. Clarkson , Kurt Mehlhorn , Raimund Seidel, Four results on randomized incremental constructions, Computational Geometry: Theory and Applications, v.3 n.4, p.185-212, Sept. 1993 [doi>10.1016/0925-7721(93)90009-U]
	8	Herbert Edelsbrunner , Lionidas J Guibas , Jorge Stolfi, Optimal point location in a monotone subdivision, SIAM Journal on Computing, v.15 n.2, p.317-340, May 1986 [doi>10.1137/0215023]
	9	D. G. Kirkpatrick. Optimal search in planar subdivisions. SiAM Journal of Computing, 12:28-35, 1983.
	10	K. Mehlhorn. Data Structures and Efficient Algorithms, volume I, II, III. Springer Verlag, Berlin, 1984.
	11	Kurt Mehlhorn , Stefan Näher, Algorithm Design and Software Libraries: Recent Developments in the LEDA Project, Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1, p.493-505, September 07-11, 1992
	12	Kurt Mehlhorn , Stefan Näher, LEDA: a platform for combinatorial and geometric computing, Communications of the ACM, v.38 n.1, p.96-102, Jan. 1995 [doi>10.1145/204865.204889]
	13	M. M/iller and J. Ziegler. An implementation of a convex hull algorithm. Technical Report MPI-I-94-105, Max-Planck-Institut fiir Informatik, Saarbriicken, 1993.
	14	S. N~her and C. Uhrig. The LEDA Manual User Manual, 1995.
	15	R. Rubinfeld Designing Checkers for Programs that Run in Parallel, Manuscript, 1994.
	16	Neil Sarnak , Robert E. Tarjan, Planar point location using persistent search trees, Communications of the ACM, v.29 n.7, p.669-679, July 1986 [doi>10.1145/6138.6151]
	17	R Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.404-413, May 28-30, 1986, Berkeley, California, United States [doi>10.1145/12130.12172]

CITED BY 5

	Kurt Mehlhorn , Michael Müller , Stefan Näher , Stefan Schirra , Michael Seel , Christian Uhrig , Joachim Ziegler, A computational basis for higher-dimensional computational geometry and applications, Proceedings of the thirteenth annual symposium on Computational geometry, p.254-263, June 04-06, 1997, Nice, France
	Kurt Mehlhorn, The reliable algorithmic software challenge RASC, Computer science in perspective, Springer-Verlag New York, Inc., New York, NY, 2003
	Bernard Chazelle , C. Seshadhri, Online geometric reconstruction, Proceedings of the twenty-second annual symposium on Computational geometry, June 05-07, 2006, Sedona, Arizona, USA
	J. Harrison , L. Théry, A Skeptic’s Approach to Combining HOL and Maple, Journal of Automated Reasoning, v.21 n.3, p.279-294, December 1998
	Konstantin Rybnikov, An efficient local approach to convexity testing of piecewise-linear hypersurfaces, Computational Geometry: Theory and Applications, v.42 n.2, p.147-172, February, 2009