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”

Large k-Gons in a 1.5D Terrain

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F22%3A00567939" target="_blank" >RIV/67985807:_____/22:00567939 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Large k-Gons in a 1.5D Terrain

  • Original language description

    Given is a 1.5D terrain T, i.e., an x-monotone polygonal chain in R2. For a given 2 ≤ k≤ n, our objective is to approximate the largest area or perimeter convex object of exactly or at most k vertices inside T. For a constant k≥ 3, we design a near linear time FPTAS that approximates the largest convex polygons with at most k vertices, within a factor (1 - ϵ). For the case where k= 2, we discuss an O(n) time exact algorithm for computing the longest line segment in T, and for k= 3, we design an O(n2) time exact algorithm for computing the largest-perimeter triangle that lies within T.

  • 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/GJ19-06792Y" target="_blank" >GJ19-06792Y: Structural properties of visibility in terrains and farthest color Voronoi diagrams</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2022

  • 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

    Computing and Combinatorics: 28th International Conference, COCOON 2022 Proceedings

  • ISBN

    978-3-031-22104-0

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    12

  • Pages from-to

    49-60

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Shenzhen

  • Event date

    Oct 22, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000916958900005