1879 search results - page 83 / 376 » Computational geometry algorithms library |
119
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
140
click to vote
CISST
2003
15 years 5 months ago
2003
We present a new method to compress triangle meshes in a lossless manner. Triangle compression requires compression of the geometry (vertices) as well as the topology (connectivit...
145
click to vote
CGF
2006
15 years 4 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
156
click to vote
JAVA
2001
Springer
15 years 8 months ago
2001
Springer
The computational science community is reluctant to write largescale computationally-intensive applications in Java due to concerns over Java’s poor performance, despite the cla...
120
click to vote
SGP
2007
15 years 6 months ago
2007
We present a streaming algorithm for reconstructing closed surfaces from large non-uniform point sets based on a geometric convection technique. Assuming that the sample points ar...