Sciweavers

2093 search results - page 31 / 419
» Statistical Point Geometry
Sort
View
COMPGEOM
2003
ACM
14 years 1 months ago
Estimating surface normals in noisy point cloud data
In this paper we describe and analyze a method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presenc...
Niloy J. Mitra, An Nguyen
WAE
2000
95views Algorithms» more  WAE 2000»
13 years 9 months ago
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangemen...
Iddo Hanniel, Dan Halperin
COMPGEOM
1996
ACM
13 years 12 months ago
Robust Adaptive Floating-Point Geometric Predicates
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...
Jonathan Richard Shewchuk
WAE
2001
223views Algorithms» more  WAE 2001»
13 years 9 months ago
An Adaptable and Extensible Geometry Kernel
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects...
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvai...
FFA
2006
69views more  FFA 2006»
13 years 7 months ago
Information sets and partial permutation decoding for codes from finite geometries
We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also ...
Jennifer D. Key, T. P. McDonough, Vassili C. Mavro...