Ray shooting in polygons using geodesic triangulations (Q1330785): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Michelangelo Grigni / rank
 
Normal rank
Property / author
 
Property / author: J. E. Hershberger / rank
 
Normal rank
Property / author
 
Property / author: Micha Sharir / rank
 
Normal rank
Property / author
 
Property / author: Jack Scott Snoeyink / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of cutting complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional cascading. I: A data structuring technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional cascading. II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility and intersection problems in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast detection of polyhedral intersection / 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: A linear algorithm for computing the visibility polygon from a point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new data structure for shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean shortest paths in the presence of rectilinear barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance of configurations in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank

Latest revision as of 16:14, 22 May 2024

scientific article
Language Label Description Also known as
English
Ray shooting in polygons using geodesic triangulations
scientific article

    Statements

    Ray shooting in polygons using geodesic triangulations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 1994
    0 references
    This paper presents a new kind of triangulation of simple polygons, which has a low stabbing number (any segment inside the polygon crosses only a logarithmic number of `triangles') and which helps solve diverse visibility problems such as, ray shooting from inside or outside the polygon, visibility inside the polygon from a given point.
    0 references
    ray shooting
    0 references
    triangulation
    0 references
    simple polygons
    0 references
    visibility
    0 references

    Identifiers