102291 search results - page 180 / 20459 » Computability in Computational Geometry |
148
Voted
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
138
click to vote
CGA
2008
15 years 6 months ago
2008
An ordered series of control poses may be interpolated by a polyscrew (piecewise helical) rigid body motion composed of a series of screws, each interpolating a pair of consecutiv...
141
Voted
DGCI
2009
Springer
16 years 21 days ago
2009
Springer
In this report, we propose a new definition of the E2 DT (Squared Euclidean Distance Transformation) on irregular isothetic grids. We describe a new separable algorithm to compute...
172
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
147
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...