Sciweavers

2843 search results - page 224 / 569
» Interpolation by geometric algorithm
Sort
View
105
Voted
ESA
2008
Springer
92views Algorithms» more  ESA 2008»
15 years 5 months ago
How Reliable Are Practical Point-in-Polygon Strategies?
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
Stefan Schirra
101
Voted
CCCG
2006
15 years 5 months ago
Polygon Reconstruction from Line Cross-Sections
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...
Gill Barequet, Craig Gotsman, Avishay Sidlesky
119
Voted
SODA
2003
ACM
112views Algorithms» more  SODA 2003»
15 years 5 months ago
Perturbations and vertex removal in a 3D delaunay triangulation
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still ...
Olivier Devillers, Monique Teillaud
151
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
131
Voted
ECCV
2006
Springer
16 years 5 months ago
Riemannian Manifold Learning for Nonlinear Dimensionality Reduction
In recent years, nonlinear dimensionality reduction (NLDR) techniques have attracted much attention in visual perception and many other areas of science. We propose an efficient al...
Tony Lin, Hongbin Zha, Sang Uk Lee