102291 search results - page 154 / 20459 » Computability in Computational Geometry |
137
click to vote
PG
1998
IEEE
15 years 9 months ago
1998
IEEE
The construction of shape spaces is studied from a mathematical and a computational viewpoint. A program is outlined reducing the problem to four tasks: the representation of geom...
121
click to vote
ICPR
2008
IEEE
16 years 6 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...
150
click to vote
CGA
2004
15 years 4 months ago
2004
Point-based rendering is a compact and efficient means of displaying complex geometry. Our goal is to enable flexible point-based rendering, permitting local image refinement, req...
135
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
This video describes a new type of 3D curves, which generalizes the family of 2D Euler spirals. They are defined as the curves having both their curvature and their torsion evolv...
166
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...