2980 search results - page 206 / 596 » Computational Geometry |
147
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
117
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
146
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
122
Voted
DGCI
2008
Springer
15 years 5 months ago
2008
Springer
A novel method for segmenting simplified skeletons of 3D shapes is presented. The so-called simplified Y-network is computed, defining boundaries between 2D sheets of the simplifie...
252
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...