Národní úložiště šedé literatury Nalezeno 1 záznamů.  Hledání trvalo 0.01 vteřin. 

Warning: Requested record does not seem to exist.
Large Perimeter Objects Surrounded by a 1.5D Terrain
Keikha, Vahideh
Given is a 1.5D terrain T , i.e., an x-monotone polygonal chain in R2. Our objective is to approximate the largest area or perimeter convex polygon with at most k vertices inside T . For a constant k > 0, we design an FPTAS that efficiently approximates such polygons within a factor (1 − ǫ). For the special case of the´largest-perimeter contained triangle in T , we design an O(n log n) time exact algorithm that matches the same result for the area measure.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.