1879 search results - page 91 / 376 » Computational geometry algorithms library |
144
Voted
IMR
2004
Springer
15 years 9 months ago
2004
Springer
The Delaunay Refinement Algorithm for quality meshing is extended to three dimensions. The algorithm accepts input with arbitrarily small angles, and outputs a Conforming Delauna...
151
Voted
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
132
click to vote
CGA
2007
15 years 4 months ago
2007
— Laplacian instability is the physical mechanism that drives pattern formation in many disparate natural phenomena. However, current algorithms for simulating this instability a...
131
Voted
EUROPAR
2003
Springer
15 years 9 months ago
2003
Springer
In this paper we propose a new parallel clustering algorithm based on the incremental construction of the compact sets of a collection of objects. This parallel algorithm is portab...
208
click to vote
CASC
2011
Springer
14 years 4 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...