102291 search results - page 68 / 20459 » Computability in Computational Geometry |
139
click to vote
SGP
2003
15 years 5 months ago
2003
We propose a scheme for modeling point sample geometry with statistical analysis. In our scheme we depart from the current schemes that deterministically represent the attributes ...
139
click to vote
SIGGRAPH
2000
ACM
15 years 8 months ago
2000
ACM
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist o...
152
click to vote
COMPGEOM
2000
ACM
15 years 8 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...
116
click to vote
COCOA
2009
Springer
15 years 8 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...
131
click to vote
ALENEX
2004
15 years 5 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...