4850 search results - page 189 / 970 » Proof and Computation in Geometry |
186
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
142
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy eval...
149
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
173
click to vote
CGF
2008
15 years 6 months ago
2008
We present a generalization of thin-plate splines for interpolation and approximation of manifold-valued data, and demonstrate its usefulness in computer graphics with several app...
157
click to vote
ALENEX
2004
15 years 8 months ago
2004
We present a framework for implementing geometric algorithms involving motion. It is written in C++ and modeled after and makes extensive use of CGAL (Computational Geometry Algor...