2093 search results - page 114 / 419 » Statistical Point Geometry |
106
Voted
IMR
2005
Springer
15 years 8 months ago
2005
Springer
This paper describes an interior surface generation method and a strategy for all-hexahedral mesh generation. It is well known that a solid homeomorphic to a ball with even number...
125
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
120
Voted
COMPGEOM
2007
ACM
15 years 6 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
114
click to vote
COMPGEOM
1995
ACM
15 years 6 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
101
Voted
DCC
2006
IEEE
16 years 2 months ago
2006
IEEE
We construct various classes of low-density parity-check codes using point-line incidence structures in the classical projective plane PG(2, q). Each incidence structure is based ...