Finding the \(\Theta \)-guarded region

DOI10.1016/j.comgeo.2009.07.001zbMath1192.65025OpenAlexW1516616229MaRDI QIDQ1037785

Ralf Osbild, Domagoj Matijević

Publication date: 16 November 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.07.001

zbMATH Keywords

algorithmboundary\(\alpha\)-embracing contour\(\Theta\)-guarded regionconvex hull generalizationgood \(\Theta\)-illuminationunoriented \(\Theta\)-maxima

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Efficient partition trees
• A combinatorial theorem in plane geometry
• Algorithms for Reporting and Counting Geometric Intersections
• On the shape of a set of points in the plane
• On the convex layers of a planar set
• On k-Hulls and Related Problems
• Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms