Divide and Conquer Method for k-Set Polygons

DOI10.1007/978-3-540-89550-3_18zbMath1162.68745OpenAlexW97956578MaRDI QIDQ5302751

Wael El Oraiby, Dominique Schmitt

Publication date: 13 January 2009

Published in: Computational Geometry and Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89550-3_18

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Maintenance of configurations in the plane
• Improved bounds for planar \(k\)-sets and related problems
• In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions
• On the identification of the convex hull of a finite set of points in the plane
• On k-Hulls and Related Problems
• Point sets with many k -sets
• k-Sets of Convex Inclusion Chains of Planar Point Sets
• Unnamed Item
• Unnamed Item