Sciweavers

1879 search results - page 77 / 376
» Computational geometry algorithms library
Sort
View
COMPGEOM
2008
ACM
15 years 5 months ago
Delpsc: a delaunay mesher for piecewise smooth complexes
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
Tamal K. Dey, Joshua A. Levine
VMV
2007
155views Visualization» more  VMV 2007»
15 years 5 months ago
Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky e...
David Bommes, Leif Kobbelt
CGA
1999
15 years 3 months ago
Dynamics Modeling and Culling
emsintovirtualenvironments,whileabstracting the modeling process as much as possible. To achieve efficiency,weconcentrateoncullingdynamicalsystems: if the system is not in view, we...
Stephen Chenney, Jeffrey Ichnowski, David A. Forsy...
ICCAD
2008
IEEE
107views Hardware» more  ICCAD 2008»
15 years 10 months ago
Importance sampled circuit learning ensembles for robust analog IC design
This paper presents ISCLEs, a novel and robust analog design method that promises to scale with Moore’s Law, by doing boosting-style importance sampling on digital-sized circuit...
Peng Gao, Trent McConaghy, Georges G. E. Gielen
JPDC
2008
129views more  JPDC 2008»
15 years 4 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...