scientific article

zbMATH Open0769.68117MaRDI QIDQ4036601FDOQ4036601

Binay Bhattacharya, Godfried Toussaint

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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)

Cited In (4)

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

   Recommendations

• Computing shortest transversals 👍 👎
• COMPUTING SHORTEST TRANSVERSALS OF SETS 👍 👎
• Computing almost shortest paths 👍 👎
• Title not available (Why is that?) 👍 👎
• Sublinear Longest Path Transversals 👍 👎
• Computing homotopic shortest paths efficiently 👍 👎
• Title not available (Why is that?) 👍 👎
• Computing shortest paths amid convex pseudodisks 👍 👎
• Finding Shortest Paths With Computational Geometry 👍 👎
• Title not available (Why is that?) 👍 👎

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)