3025 search results - page 172 / 605 » Computational geometry: a retrospective |
141
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...
186
click to vote
SI3D
2010
ACM
16 years 1 months ago
2010
ACM
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...
164
click to vote
CGF
2008
15 years 6 months ago
2008
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
151
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We propose a generic computational framework for maintaining a discrete geometric structure defined by a collection of static and mobile objects. We assume that the mobile object...
184
click to vote
ANTS
2010
Springer
15 years 9 months ago
2010
Springer
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...