Computing shortest transversals
From MaRDI portal
Publication:757096
DOI10.1007/BF02239165zbMath0723.68102MaRDI QIDQ757096
Binay K. Bhattacharya, Godfried T. Toussaint
Publication date: 1991
Published in: Computing (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Theory of compilers and interpreters (68N20) Convex sets in (2) dimensions (including convex curves) (52A10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Related Items (2)
COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME ⋮ COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
Cites Work
- Unnamed Item
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- Fast detection of polyhedral intersection
- Algorithms for high dimensional stabbing problems
- Finding transversals for sets of simple geometric figures
- Visibility between two edges of a simple polygon
- The shortest watchtower and related problems for polyhedral terrains
- Two counterexamples concerning transversals for convex subsets of the plane
- Maintenance of configurations in the plane
- Stabbing line segments
- External visibility
- Polyhedral line transversals in space
- Some properties of \(L\) sets in the plane
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Finding the smallest triangles containing a given convex polygon
- The Ultimate Planar Convex Hull Algorithm?
- Computing the extreme distances between two convex polygons
- Computing the convex hull of line intersections
- An optimal algorithm for finding minimal enclosing triangles
- An on-line algorithm for fitting straight lines between data ranges
- The Sofa Problem
- Visible Shorelines
- Geometric Extremum Problems
- Minimal Sets of Visibility
This page was built for publication: Computing shortest transversals
