scientific article; zbMATH DE number 176771
From MaRDI portal
Publication:4036601
zbMATH Open0769.68117MaRDI QIDQ4036601FDOQ4036601
Authors: Binay Bhattacharya, Godfried Toussaint 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
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
algorithmgeometric optimizationline-of-sightisothetic rectanglesshortest line segment\(n\)-vertex polygonline-fitting
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (5)
- 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
- COMPUTING SHORTEST TRANSVERSALS OF SETS
- Optimal algorithms for some intersection radius problems
- COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
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)
