Computing largest empty circles with location constraints (Q3039008): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Locating a Set of Points in a Planar Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716329 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01008046 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969583227 / rank
 
Normal rank

Latest revision as of 10:59, 30 July 2024

scientific article
Language Label Description Also known as
English
Computing largest empty circles with location constraints
scientific article

    Statements

    Computing largest empty circles with location constraints (English)
    0 references
    1983
    0 references
    largest empty circle problem
    0 references
    facility location
    0 references
    polygons
    0 references
    computational geometry
    0 references
    convex hull
    0 references
    planar geometry
    0 references

    Identifiers

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