Sciweavers

23 search results - page 3 / 5
» A Progressive Algorithm for Three Point Transport
Sort
View
PG
2003
IEEE
13 years 11 months ago
A State Machine for Real-Time Cutting of Tetrahedral Meshes
We introduce an algorithm that consistently and accurately processes arbitrary intersections in tetrahedral meshes in real-time. The intersection surfaces are modeled up to the cu...
Daniel Bielser, Pascal Glardon, Matthias Teschner,...
SIGGRAPH
1993
ACM
13 years 9 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
BMCBI
2008
125views more  BMCBI 2008»
13 years 5 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
PEWASUN
2006
ACM
13 years 11 months ago
Wave propagation using the photon path map
In wireless network planning, much effort is spent on the improvement of the network and transport layer – especially for Mobile Ad Hoc Networks. Although in principle realworl...
Arne Schmitz, Leif Kobbelt
CGF
2010
153views more  CGF 2010»
13 years 5 months ago
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
Tamal K. Dey, Joshua A. Levine, A. Slatton