Fast computation of smallest enclosing circle with center on a query line segment (Q975487): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4344150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2704991 / 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: Constrained Minimum Enclosing Circle with Center on a Query Line Segment / rank
 
Normal rank

Latest revision as of 21:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Fast computation of smallest enclosing circle with center on a query line segment
scientific article

    Statements

    Fast computation of smallest enclosing circle with center on a query line segment (English)
    0 references
    0 references
    0 references
    0 references
    9 June 2010
    0 references
    1-center problem
    0 references
    furthest point Voronoi diagram
    0 references
    geometric duality
    0 references
    computational geometry
    0 references
    algorithms
    0 references

    Identifiers