Computing shortest transversals (Q757096): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Binay K. Bhattacharya / rank
Normal rank
 
Property / author
 
Property / author: Godfried T. Toussaint / rank
Normal rank
 
Property / author
 
Property / author: Binay K. Bhattacharya / rank
 
Normal rank
Property / author
 
Property / author: Godfried T. Toussaint / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for high dimensional stabbing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility between two edges of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the convex hull of line intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral line transversals in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: External visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Extremum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast detection of polyhedral intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding transversals for sets of simple geometric figures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the extreme distances between two convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabbing line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the upper envelope of n line segments in O(n log n) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of \(L\) sets in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ultimate Planar Convex Hull Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the smallest triangles containing a given convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two counterexamples concerning transversals for convex subsets of the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for finding minimal enclosing triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line algorithm for fitting straight lines between data ranges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance of configurations in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest watchtower and related problems for polyhedral terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Sets of Visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visible Shorelines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sofa Problem / rank
 
Normal rank

Latest revision as of 14:25, 21 June 2024

scientific article
Language Label Description Also known as
English
Computing shortest transversals
scientific article

    Statements

    Computing shortest transversals (English)
    0 references
    0 references
    1991
    0 references
    transversals
    0 references
    stabbing lines
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references