Computing shortest transversals

DOI10.1007/BF02239165MaRDI QIDQ757096zbMATHFDO

Authors Binay Bhattacharya, Godfried Toussaint

Publication date 1991

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

transversalsstabbing lines

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10) Theory of compilers and interpreters (68N20) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Recommendations

• Publication:4036601
• Transversal of disjoint convex polygons.
• COMPUTING SHORTEST TRANSVERSALS OF SETS
• Finding transversals for sets of simple geometric figures
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS

Cites work

• scientific article; zbMATH DE number 3746987 (Why is no real title available?)
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• Algorithms for high dimensional stabbing problems
• An on-line algorithm for fitting straight lines between data ranges
• An optimal algorithm for finding minimal enclosing triangles
• Computing the convex hull of line intersections
• Computing the extreme distances between two convex polygons
• External visibility
• Fast detection of polyhedral intersection
• Finding the smallest triangles containing a given convex polygon
• Finding the upper envelope of n line segments in O(n log n) time
• Finding transversals for sets of simple geometric figures
• Geometric Extremum Problems
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Maintenance of configurations in the plane
• Minimal Sets of Visibility
• Polyhedral line transversals in space
• Some properties of \(L\) sets in the plane
• Stabbing line segments
• The Sofa Problem
• The Ultimate Planar Convex Hull Algorithm?
• The shortest watchtower and related problems for polyhedral terrains
• Two counterexamples concerning transversals for convex subsets of the plane
• Visibility between two edges of a simple polygon
• Visible Shorelines

Cited in

(4)

• COMPUTING SHORTEST TRANSVERSALS OF SETS
• COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
• scientific article; zbMATH DE number 176771 (Why is no real title available?)
• COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON

This page was built for publication: Computing shortest transversals

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