Sciweavers

18155 search results - page 134 / 3631
» Point
Sort
View
CCCG
2003
15 years 3 months ago
Estimation of the necessary number of points in Riemannian Voronoi
G. Leibon and D. Letscher showed that for general and sufficiently dense point set its Delaunay triangulation and Voronoi diagram in Riemannian manifold exist. They also proposed ...
Kensuke Onishi, Jin-ichi Itoh
SODA
2004
ACM
58views Algorithms» more  SODA 2004»
15 years 3 months ago
Point containment in the integer hull of a polyhedron
We show that the point containment problem in the integer hull of a polyhedron, which is defined by m inequalities, with coefficients of at most bits can be solved in time O(m + ...
Ernst Althaus, Friedrich Eisenbrand, Stefan Funke,...
DAGSTUHL
1997
15 years 3 months ago
Interpolation and Approximation of Surfaces from Three-dimensional Scattered Data Points
There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and...
Robert Mencl, Heinrich Müller
CHI
2009
ACM
15 years 2 months ago
Spatio-temporal interest points for video analysis
In this paper, we discuss the potential for effective representations of video data to aid analysis of large datasets of video clips and describe a prototype developed to explore ...
Ramsin Khoshabeh, James D. Hollan
IPL
2006
105views more  IPL 2006»
15 years 1 months ago
A new approximation algorithm for labeling points with circle pairs
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such...
Minghui Jiang