A 3-D visualization of kirkpatrick's planar point location algorithm

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A 3-D visualization of kirkpatrick's planar point location algorithm

Full text

Pdf (49 KB)

Source

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

San Diego, California, USA

SESSION: Video and multimedia session table of contents

Pages: 377 - 377

Year of Publication: 2003

ISBN:1-58113-663-3

Author

John Iacono

Polytechnic Univerisity, Brooklyn NY

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 22, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues peer to peer

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/777792.777851 What is a DOI?

ABSTRACT

A video is presented illustrating Kirkpatrick's planar point location structure.

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.

D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12:28--35, 1983.

INDEX TERMS

Primary Classification:
F. Theory of Computation
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2.2 Nonnumerical Algorithms and Problems
Subjects: Geometrical problems and computations