Sciweavers

5210 search results - page 108 / 1042
» Exact geometric computation
Sort
View
CVPR
2012
IEEE
13 years 11 days ago
Geometric understanding of point clouds using Laplace-Beltrami operator
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...
Jian Liang, Rongjie Lai, Tsz Wai Wong, Hongkai Zha...
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 2 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
CVPR
2004
IEEE
15 years 12 months ago
Globally Optimal Segmentation of Interacting Surfaces with Geometric Constraints
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
IEEECGIV
2006
IEEE
15 years 4 months ago
Real-Time Tracking with Non-Rigid Geometric Templates Using the GPU
The tracking of features in real-time video streams forms the integral part of many important applications in human-computer interaction and computer vision. Unfortunately trackin...
Julius Fabian Ohmer, Frédéric Maire,...
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
14 years 9 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