Algorithms for deciding the containment of polygons

DOI10.1016/0020-0190(09)60016-8zbMath0875.68904OpenAlexW2010754597WikidataQ127492064 ScholiaQ127492064MaRDI QIDQ671621

Antonio Hernández Barrera

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(09)60016-8

zbMATH Keywords

AlgorithmsComputational geometryPolygon containment

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Topologically sweeping an arrangement
• Triangulating a simple polygon in linear time
• Efficient maintenance of the union of intervals on a line, with applications
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Polygon containment under translation
• Dynamization of order decomposable set problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for deciding the containment of polygons