All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Guarding a 1.5D Terrain with Imprecise Viewpoints

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F25%3A00639507" target="_blank" >RIV/67985807:_____/25:00639507 - isvavai.cz</a>

  • Alternative codes found

    RIV/00216208:11320/25:10513729

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-031-98740-3_1" target="_blank" >https://doi.org/10.1007/978-3-031-98740-3_1</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-98740-3_1" target="_blank" >10.1007/978-3-031-98740-3_1</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Guarding a 1.5D Terrain with Imprecise Viewpoints

  • Original language description

    Given an n-vertex 1.5D terrain T and a set of m edges of T, we study the problem of placing one viewpoint on each edge so that the total length of the visible portions of the terrain is maximized. We present an O(n+mlogm) time 12-approximation algorithm for the general problem, and polynomial-time algorithms for the cases m=1 and m=2. Additionally, we show that the problem of computing a point on T maximizing the visible portion of T can be solved in O(n3) time.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GX23-04949X" target="_blank" >GX23-04949X: Fundamental questions of discrete geometry</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2025

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Combinatorial Algorithms. 36th International Workshop, IWOCA 2025 Proceedings

  • ISBN

    978-3-031-98739-7

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    14

  • Pages from-to

    3-16

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Bozeman

  • Event date

    Jul 21, 2025

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001596018900001