Parallel robust algorithms for constructing strongly convex hulls

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parallel robust algorithms for constructing strongly convex hulls

Full text

Pdf (705 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: 133 - 140

Year of Publication: 1996

ISBN:0-89791-804-5

Authors

Wei Chen	Department of Electrical and Computer Engineering, Nagoya Institute of Technology, Showa, Nagoya 466, Japan
Koichi Wada	Department of Electrical and Computer Engineering, Nagoya Institute of Technology, Showa, Nagoya 466, Japan
Kimio Kawaguchi	Department of Electrical and Computer Engineering, Nagoya Institute of Technology, Showa, Nagoya 466, Japan

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

Additional Information:

references 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.237329 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	A. Aggarwal, B. Chazelle, L. Glfibas, C. O'Dunlaing, and C. Yap: Parallel computational geometry. Alqorithmica. 3, 293-327, 1988.
	2	D. P. Dobkin , D. Silver, Recipes for geometry and numerical analysis - Part I: an empirical study, Proceedings of the fourth annual symposium on Computational geometry, p.93-105, June 06-08, 1988, Urbana-Champaign, Illinois, United States [doi>10.1145/73393.73404]
	3	S. Fortune: Stable maintenance of point set trianglllations in two dimensions. In Proc. of the 30th Annual Symposium on Foundations of Computer Science, 494-499, 1989.
	4	Alan Gibbons , Wojciech Rytter, Efficient parallel algorithms, Cambridge University Press, New York, NY, 1988
	5	D. H. Greene and F. F. Yao: Finite-resolution comp~tational geometry. In Proc. of the 27th IEEE Symposium on Foundations of Computer Science, 143-152, 1986.
	6	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]
	7	L. Guibas, D Salesin and J. Stolfi: Constmlcting strongly convex approximate hulls with inaccllrate primitives. Algorithmica, 9, 534- 560, 1993.
	8	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]
	9	Z. Li and V. J. Milenkovic: Constructing strongly convex hulls using exact or rounded arithmetic. Algorithmica, vol. 8, 345-364, 1992.
	10	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]
	11	V. Milenkovic, Calculating approximate curve arrangements using rounded arithmetic, Proceedings of the fifth annual symposium on Computational geometry, p.197-207, June 05-07, 1989, Saarbruchen, West Germany [doi>10.1145/73833.73856]
	12	V. J. Milcnkovic: Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic. In Proc. of the 30th Annual $ymposiurn on Foundations of Computer Science, 500-505, 1989.
	13	T. Ottmann , G. Theimt , C. Ullrich, Numerical stability of geometric algorithms, Proceedings of the third annual symposium on Computational geometry, p.119-125, June 08-10, 1987, Waterloo, Ontario, Canada [doi>10.1145/41958.41970]