1879 search results - page 61 / 376 » Computational geometry algorithms library |
152
click to vote
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, ...
130
click to vote
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
We present a general algorithm for plane-based calibration that can deal with arbitrary numbers of views and calibration planes. The algorithm can simultaneously calibrate differe...
117
click to vote
IMR
2003
Springer
15 years 9 months ago
2003
Springer
A local cell quality metric is introduced and used to construct a variational functional for a grid smoothing algorithm. A maximum principle is proved and the properties of the loc...
127
Voted
APVIS
2004
15 years 5 months ago
2004
The visualisation pipeline approach is a flexible and extensible technique for generating visualisations. The basic pipeline functions involve the capture and representation of da...
151
click to vote
SIGGRAPH
1993
ACM
15 years 8 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...