Sciweavers

2093 search results - page 54 / 419
» Statistical Point Geometry
Sort
View
CGF
2005
138views more  CGF 2005»
13 years 10 months ago
Approximation of a Variable Density Cloud of Points by Shrinking a Discrete Membrane
This paper describes a method to obtain a closed surface that approximates a general 3D data point set with non-uniform density. Aside from the positions of the initial data point...
Jordi Esteve, Pere Brunet, Alvar Vinacua
SIBGRAPI
2006
IEEE
14 years 4 months ago
Point set compression through BSP quantization
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
Alex Laier Bordignon, Thomas Lewiner, Hélio...
COMPGEOM
2004
ACM
14 years 3 months ago
Separating point sets in polygonal environments
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Jo...
BMVC
2000
13 years 11 months ago
A New Approach for Vanishing Point Detection in Architectural Environments
A man-made environment is characterized by a lot of parallel lines and a lot of orthogonal edges. In this article, a new method for detecting the three mutual orthogonal direction...
Carsten Rother
DAM
1999
137views more  DAM 1999»
13 years 9 months ago
How to Find a Point on a Line Within a Fixed Distance
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in t...
Christoph A. Hipke, Christian Icking, Rolf Klein, ...