scientific article; zbMATH DE number 3883608

MaRDI QIDQ3217600zbMATH OpenFDO

Authors Jerzy W. Jaromczyk

Publication date 1984

zbMATH Keywords

computational geometrydiameter of a set of pointslower boundsmaximal distance between two sets of pointspolygon simplicity testingtime-complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A lower bound technique for triangulations of simplotopes
• The complexity of computing minimum separating polygons
• On the minimality of polygon triangulation
• Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
• Lower bounds for approximate polygon decomposition and minimum gap
• Fine-grained complexity theory: conditional lower bounds for computational geometry
• scientific article; zbMATH DE number 4062591
• Lower bound theorems for general polytopes
• scientific article; zbMATH DE number 4114000
• Explicit lower bounds via geometric complexity theory

Cited in

(2)

• Lower bounds on cube simplexity
• Settling the bound on the rectilinear link radius of a simple rectilinear polygon

This page was built for publication:

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