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”

Terrain visibility with multiple viewpoints

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10190932" target="_blank" >RIV/00216208:11320/13:10190932 - isvavai.cz</a>

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007%2F978-3-642-45030-3_30" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-45030-3_30</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-45030-3_30" target="_blank" >10.1007/978-3-642-45030-3_30</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Terrain visibility with multiple viewpoints

  • Original language description

    We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider three fundamental visibility structures: the visibility map, the colored visibility map, and the Voronoi visibility map. We study the complexityof each structure for both 1.5D and 2.5D terrains, and provide efficient algorithms to construct them. Our algorithm for the visibility map in 2.5D terrains improves on the only existing algorithm in this setting.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GEGIG%2F11%2FE023" target="_blank" >GEGIG/11/E023: Graph Drawings and Representations</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2013

  • 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

    Algorithms and Computation; 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings

  • ISBN

    978-3-642-45029-7

  • ISSN

  • e-ISSN

  • Number of pages

    11

  • Pages from-to

    317-327

  • Publisher name

    Springer New York LLC

  • Place of publication

    New York

  • Event location

    Hong Kong

  • Event date

    Dec 16, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article