Divide and Conquer Method for k-Set Polygons

DOI10.1007/978-3-540-89550-3_18MaRDI QIDQ5302751zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Minimum polygonal separation
• An upper bound on the number of planar K-sets
• Point sets with many \(k\)-sets
• A class of point-sets with few k-sets
• k-Sets of Convex Inclusion Chains of Planar Point Sets

Cites work

• scientific article; zbMATH DE number 2185596 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• Improved bounds for planar k-sets and related problems
• In between k-sets, j-facets, and i-faces: (i,j)-partitions
• k-Sets of Convex Inclusion Chains of Planar Point Sets
• Maintenance of configurations in the plane
• On k-Hulls and Related Problems
• On the identification of the convex hull of a finite set of points in the plane
• Point sets with many k -sets

Cited in

(3)

• scientific article; zbMATH DE number 2185596 (Why is no real title available?)
• Centroid triangulations from \(k\)-sets
• k-Sets of Convex Inclusion Chains of Planar Point Sets

This page was built for publication: Divide and Conquer Method for k-Set Polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302751)