1879 search results - page 53 / 376 » Computational geometry algorithms library |
124
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algori...
126
click to vote
DELOS
2000
15 years 5 months ago
2000
: This paper presents an overview over parallel architectures for the efficient realisation of digital libraries by considering image databases as an example. The state of the art ...
151
click to vote
VMV
2004
15 years 5 months ago
2004
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
105
click to vote
IMR
2003
Springer
15 years 9 months ago
2003
Springer
A Cartesian grid generation methodology is developed for unsteady control volume computational fluid dynamic (CFD) solvers. Arbitrary combinations and numbers of moving and statio...
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...