Sciweavers

839 search results - page 96 / 168
» Three-Clustering of Points in the Plane
Sort
View
GMP
2006
IEEE
157views Solid Modeling» more  GMP 2006»
14 years 4 months ago
Density-Controlled Sampling of Parametric Surfaces Using Adaptive Space-Filling Curves
Abstract. Low-discrepancy point distributions exhibit excellent uniformity properties for sampling in applications such as rendering and measurement. We present an algorithm for ge...
J. A. Quinn, Frank C. Langbein, Ralph R. Martin, G...
GD
2009
Springer
14 years 2 months ago
Drawing Hamiltonian Cycles with No Large Angles
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...
Adrian Dumitrescu, János Pach, Géza ...
COMPGEOM
2007
ACM
14 years 2 months ago
Streaming algorithms for line simplification
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...
Mohammad Ali Abam, Mark de Berg, Peter Hachenberge...
NIPS
2007
13 years 11 months ago
Measuring Neural Synchrony by Message Passing
A novel approach to measure the interdependence of two time series is proposed, referred to as “stochastic event synchrony” (SES); it quantifies the alignment of two point pr...
Justin Dauwels, François B. Vialatte, Tomas...
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
13 years 10 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri