2980 search results - page 178 / 596 » Computational Geometry |
157
Voted
SGP
2003
15 years 4 months ago
2003
We solve the problem of computing global conformal parameterizations for surfaces with nontrivial topologies. The parameterization is global in the sense that it preserves the con...
134
click to vote
SMA
2003
ACM
15 years 8 months ago
2003
ACM
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
128
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
137
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems and solved from a minimal number of image points. Finding ...
111
Voted
COMPGEOM
2003
ACM
15 years 8 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...