Covering points with a polygon

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Covering points with a polygon

Full text

Pdf (118 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the twenty-first annual symposium on Computational geometry table of contents

Pisa, Italy

SESSION: Video/multimedia presentations table of contents

Pages: 376 - 377

Year of Publication: 2005

ISBN:1-58113-991-8

Authors

Gill Barequet	The Technion--IIT, Haifa, Israel
Yuval Scharf	The Technion--IIT, Haifa, Israel
Matthew T. Dickerson	Middlebury College, Middlebury, VT

Sponsors

ACM: Association for Computing Machinery
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): 23, Citation Count: 0

Additional Information:

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

ABSTRACT

We present a diagram that captures containmen information for scalable rotated and ranslated versions of a convex polygon. For a given polygon P and a contact point q in a point set S , the diagram parameterizes possible translations, rotations, and scales of he polygon in order to represent containmen regions for each additional point v ∈ S . We present geometric and combinatorial properties for this diagram, and describe how it can be computed and used for solving several geometric problems.

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	G. Barequet and M. Dickerson. The translation-scale diagram for point-containing placements of a convex polygon. In Proc. of 12th Canadian Conf. on Comp. Geom., (Fredericton, New Brunswick, Canada, 7-12, 2000), 2000.
	2	M. Dickerson and D. Scharstein. Optimal placement of a convex polygon to maximize point containment. CGTA, 11:1--16, 1998.
	3	Y. Scharf. Covering points with a polygon. M.Sc. Thesis, Dept. of Computer Science, The Technion-Israel Institute of Technology, Haifa, Israel, October 2004.