3025 search results - page 205 / 605 » Computational geometry: a retrospective |
181
click to vote
COMPGEOM
2005
ACM
15 years 8 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...
176
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
This movie illustrates exact construction and maintenance of arrangements induced by arcs of great circles embedded on the sphere, also known as geodesic arcs, and exact computati...
164
click to vote
COMPGEOM
2008
ACM
15 years 8 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 ...
186
click to vote
COMPGEOM
2008
ACM
15 years 8 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, ...
169
click to vote
DGCI
2008
Springer
15 years 8 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...