Article

A Fast Algorithm for Polygon Containment by Translation (Extended Abstract)

Author:

Steven FortuneAuthors Info & Claims

Proceedings of the 12th Colloquium on Automata, Languages and Programming

Pages 189 - 198

Published: 15 July 1985 Publication History

Abstract

No abstract available.

Cited By

View all

Aronov Bde Berg MRoeloffzen MSpeckmann B(2013)Distance-Sensitive planar point locationProceedings of the 13th international conference on Algorithms and Data Structures10.1007/978-3-642-40104-6_5(49-60)Online publication date: 12-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-40104-6_5
Hall-Holt OKatz MKumar PMitchell JSityon A(2006)Finding large sticks and potatoes in polygonsProceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm10.5555/1109557.1109610(474-483)Online publication date: 22-Jan-2006
https://dl.acm.org/doi/10.5555/1109557.1109610
Milenkovic VMiller G(1996)Translational polygon containment and minimal enclosure using linear programming based restrictionProceedings of the twenty-eighth annual ACM symposium on Theory of Computing10.1145/237814.237840(109-118)Online publication date: 1-Jul-1996
https://dl.acm.org/doi/10.1145/237814.237840
Show More Cited By

A Fast Algorithm for Polygon Containment by Translation (Extended Abstract)
1. Mathematics of computing
2. Theory of computation

Recommendations

View-based query containment
PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Query containment is the problem of checking whether for all databases the answer to a query is a subset of the answer to a second query. In several data management tasks, such as data integration, mobile computing, etc., the data of interest are only ...
Decidable containment of recursive queries
Database theory

One of the most important reasoning tasks on queries is checking containment, i.e., verifying whether one query yields necessarily a subset of the result of another one. Query containment is crucial in several contexts, such as query optimization, query ...
A new grammatical transformation into LL(k) form (Extended Abstract)
STOC '74: Proceedings of the sixth annual ACM symposium on Theory of computing

For some time, it has been recognized that left-to-right deterministic top-down parsing has a number of features to recommend it. The logic of such a parser is easily expressed as a one-state pushdown machine, and very flexible translations can readily ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Proceedings of the 12th Colloquium on Automata, Languages and Programming

July 1985

519 pages

ISBN:354015650X

Editor:
Wilfried Brauer

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 15 July 1985

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Aronov Bde Berg MRoeloffzen MSpeckmann B(2013)Distance-Sensitive planar point locationProceedings of the 13th international conference on Algorithms and Data Structures10.1007/978-3-642-40104-6_5(49-60)Online publication date: 12-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-40104-6_5
Hall-Holt OKatz MKumar PMitchell JSityon A(2006)Finding large sticks and potatoes in polygonsProceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm10.5555/1109557.1109610(474-483)Online publication date: 22-Jan-2006
https://dl.acm.org/doi/10.5555/1109557.1109610
Milenkovic VMiller G(1996)Translational polygon containment and minimal enclosure using linear programming based restrictionProceedings of the twenty-eighth annual ACM symposium on Theory of Computing10.1145/237814.237840(109-118)Online publication date: 1-Jul-1996
https://dl.acm.org/doi/10.1145/237814.237840
Daniels KMilenkovic VClarkson K(1995)Multiple translational containmentProceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/313651.313699(205-214)Online publication date: 22-Jan-1995
https://dl.acm.org/doi/10.5555/313651.313699
Mount DAvis D(1992)Intersection detection and separators for simple polygonsProceedings of the eighth annual symposium on Computational geometry10.1145/142675.142737(303-311)Online publication date: 1-Jul-1992
https://dl.acm.org/doi/10.1145/142675.142737
Toledo SDrysdale R(1991)Extremal polygon containment problemsProceedings of the seventh annual symposium on Computational geometry10.1145/109648.109668(176-185)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/109648.109668
Drysdale RJohnson D(1990)A practical algorithm for computing the Delaunay triangulation for convex distance functionsProceedings of the first annual ACM-SIAM symposium on Discrete algorithms10.5555/320176.320194(159-168)Online publication date: 1-Jan-1990
https://dl.acm.org/doi/10.5555/320176.320194
Melissaratos ESouvaine DSeidel R(1990)On solving geometric optimization problems using shortest pathsProceedings of the sixth annual symposium on Computational geometry10.1145/98524.98600(350-359)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/98524.98600
Aonuma HImai HImai KTokuyama TSeidel R(1990)Maximin location of convex objects in a polygon and related dynamic Voronoi diagramsProceedings of the sixth annual symposium on Computational geometry10.1145/98524.98575(225-234)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/98524.98575
Chew LKedem KMehlhorn K(1989)Placing the largest similar copy of a convex polygon among polygonal obstaclesProceedings of the fifth annual symposium on Computational geometry10.1145/73833.73853(167-173)Online publication date: 5-Jun-1989
https://dl.acm.org/doi/10.1145/73833.73853
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

View-based query containment

Decidable containment of recursive queries

A new grammatical transformation into LL(k) form (Extended Abstract)

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations