An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization (Q4555537): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2883926673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for evaluating sequences of set-manipulation operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the visibility graph of points within a polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear space data structures for two types of range search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making data structures persistent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2970453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing visibility on terrains in external memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank

Latest revision as of 10:15, 17 July 2024

scientific article; zbMATH DE number 6981838
Language Label Description Also known as
English
An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization
scientific article; zbMATH DE number 6981838

    Statements

    An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 November 2018
    0 references
    terrain visibility
    0 references
    computational geometry
    0 references
    parallel algorithms
    0 references
    persistent data structures
    0 references

    Identifiers

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