Sciweavers

11 search results - page 1 / 3
» Compactness Theorems for Geometric Packings
Sort
View
FOCM
2010
160views more  FOCM 2010»
13 years 3 months ago
Boundary Measures for Geometric Inference
We study the boundary measures of compact subsets of the d-dimensional Euclidean space, which are closely related to Federer’s curvature measures. We show that they can be comput...
Frédéric Chazal, David Cohen-Steiner...
CCCG
2010
13 years 6 months ago
Existence of zone diagrams in compact subsets of uniformly convex spaces
A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and ...
Eva Kopecká, Daniel Reem, Simeon Reich
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 7 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
SIGGRAPH
2010
ACM
13 years 9 months ago
Feature-aligned T-meshes
High-order and regularly sampled surface representations are more efficient and compact than general meshes and considerably simplify many geometric modeling and processing algor...
Ashish Myles, Nico Pietroni, Denis Kovacs, Denis Z...