On the number of intersections of two polygons.

MaRDI QIDQ5488104zbMATH OpenFDO

Authors Jakub Černý, Jan Kára, Pavel Podbrdský, Miroslava Sotáková, Robert Šámal, Daniel Král'

Publication date 13 September 2006

Full work available at URL https://eudml.org/doc/126628, http://www.emis.de/journals/CMUC/cmuc0302/cmuc0302.htm

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

combinatorial complexity

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Combinatorial complexity of geometric structures (52C45)

Recommendations

• An almost optimal bound on the number of intersections of two simple polygons
• scientific article; zbMATH DE number 1234822
• A lower bound for the number of polygonizations of N points in the plane
• The maximum number of intersections between two plane rectangular paths
• An improved upper bound on the number of intersections between two rectangular paths

Cited in

(4)

• An almost optimal bound on the number of intersections of two simple polygons
• The Number of Intersection Points Made by the Diagonals of a Regular Polygon
• An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.
• An improved upper bound on the number of intersections between two rectangular paths

This page was built for publication: On the number of intersections of two polygons.

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