10608 search results - page 600 / 2122 » Complexity of O'Hara's Algorithm |
188
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
187
click to vote
COCO
2006
Springer
15 years 11 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
161
click to vote
ESA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for k con...
184
click to vote
CCCG
2010
15 years 8 months ago
2010
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a sim...
150
click to vote
CCCG
2006
15 years 8 months ago
2006
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...