Sciweavers

1387 search results - page 16 / 278
» Convexity in Discrete Space
Sort
View
COMPGEOM
2005
ACM
13 years 9 months ago
Multi-pass geometric algorithms
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
Timothy M. Chan, Eric Y. Chen
CGF
2007
127views more  CGF 2007»
13 years 7 months ago
A Finite Element Method on Convex Polyhedra
We present a method for animating deformable objects using a novel finite element discretization on convex polyhedra. Our finite element approach draws upon recently introduced ...
Martin Wicke, Mario Botsch, Markus H. Gross
DCG
2010
171views more  DCG 2010»
13 years 7 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...
ICMCS
2005
IEEE
111views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Enhancing curvature scale space features for robust shape classification
The curvature scale space (CSS) technique, which is also part of the MPEG-7 standard is a robust method to describe complex shapes.The central idea is to analyze the curvature of ...
Stephan Kopf, Thomas Haenselmann, Wolfgang Effelsb...
ECCV
2010
Springer
14 years 22 days ago
Convex Relaxation for Multilabel Problems with Product Label Spaces
Convex relaxations for continuous multilabel problems have attracted a lot of interest recently [1–5]. Unfortunately, in previous methods, the runtime and memory requirements sca...