81 search results - page 13 / 17 » A Geometric Foundation of Colorimetry |
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
TALG
2008
13 years 7 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
Active structures capable of responding to external stimulii represent the emerging frontier in structural design. Robust and real-time sensing, control, and actuation pose fundame...
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...