Guarding a terrain by two watchtowers (Q5961974): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-008-9270-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995551793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551354 / 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: Maintaining visibility of a polygon with a moving point of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for geometric set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for guarding polygons and terrains / 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: Finding the upper envelope of n line segments in O(n log n) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range searching with efficient hierarchical cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / 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: Q4325546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. / rank
 
Normal rank

Latest revision as of 05:55, 3 July 2024

scientific article; zbMATH DE number 5786339
Language Label Description Also known as
English
Guarding a terrain by two watchtowers
scientific article; zbMATH DE number 5786339

    Statements

    Guarding a terrain by two watchtowers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2010
    0 references
    0 references
    computational geometry
    0 references
    visibility algorithms
    0 references
    terrain guarding
    0 references
    parametric search
    0 references
    0 references