scientific article; zbMATH DE number 176771

MaRDI QIDQ4036601zbMATH OpenFDO

Authors Binay Bhattacharya, Godfried Toussaint

Publication date 18 May 1993

zbMATH Keywords

algorithmgeometric optimizationline-of-sightisothetic rectanglesshortest line segment\(n\)-vertex polygonline-fitting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing shortest transversals
• COMPUTING SHORTEST TRANSVERSALS OF SETS
• Computing almost shortest paths
• scientific article; zbMATH DE number 1251239
• Sublinear longest path transversals
• Computing homotopic shortest paths efficiently
• scientific article; zbMATH DE number 1947410
• Computing shortest paths amid convex pseudodisks
• Finding Shortest Paths With Computational Geometry
• scientific article; zbMATH DE number 3979162

Cited in

(5)

• COMPUTING SHORTEST TRANSVERSALS OF SETS
• Optimal algorithms for some intersection radius problems
• COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
• Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
• COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON

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