Voronoi diagrams for direction-sensitive distances

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Voronoi diagrams for direction-sensitive distances

Full text

Pdf (652 KB)

Source

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

Nice, France

Pages: 418 - 420

Year of Publication: 1997

ISBN:0-89791-878-9

Authors

Oswin Aichholzer	Institute for Theoretical Computer Science, Graz University of Technology, Graz, Austria
Danny Z. Chen	Department of Computer Science & Engineering, University of Notre Dame, Notre Dame, IN
D. T. Lee	Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL
Asish Mukhopadhyay	Department of Computer Science, Indian Institute of Technology, Kanpur, UP-208016, India
Evanthia Papadopoulou	IBM Watson Research Center, Yorktown Heights, NY
Franz Aurenhammer	Institute for Theoretical Computer Science, Graz University of Technology, Graz, Austria

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

Additional Information:

references 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/262839.263045 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	Atallah, M.J., Kosaraju, S.R., An etticient algorithm for znaxdominance, with applications, Algorithmica 4 (1989), 221-236.
	2	L. Paul Chew , Robert L. (Scot) Dyrsdale, III, Voronoi diagrams based on convex distance functions, Proceedings of the first annual symposium on Computational geometry, p.235-244, June 05-07, 1985, Baltimore, Maryland, United States [doi>10.1145/323233.323264]
	3	Fortune, S., A sweepliae algorithm for Voronoi diagrams, Algorithmica 2 (1987), 153-174.
	4	David G. Kirkpatrick , Raimund Seidel, Output-size sensitive algorithms for finding maximal vectors, Proceedings of the first annual symposium on Computational geometry, p.89-96, June 05-07, 1985, Baltimore, Maryland, United States [doi>10.1145/323233.323246]
	5	Klein, R., Concrete and Abstract Voronoi Diagranzs, Lecture Notes in Computer Science 400, Springer, 1989.
	6	Lee, D.T., Drysdale, R.L., Generalization of Voronoi diagrams in the plane, SIAM 3. Computing 10 (1981), 73-87.
	7	Joseph S. B. Mitchell , David M. Mount , Christos H. Papadimitriou, The discrete geodesic problem, SIAM Journal on Computing, v.16 n.4, p.647-668, Aug. 1987 [doi>10.1137/0216045]
	8	Joseph S. B. Mitchell , Christos H. Papadimitriou, The weighted region problem: finding shortest paths through a weighted planar subdivision, Journal of the ACM (JACM), v.38 n.1, p.18-73, Jan. 1991 [doi>10.1145/102782.102784]
	9	Shark, M., Intersection and closest-pair problems (1985), 448-468.
	10	Sugihara, K., Voronoi diagrams in a river, Int'l. J. Computational Geometry & Applications 2 (1992), 29-48.