Sciweavers

756 search results - page 10 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
VMV
2007
155views Visualization» more  VMV 2007»
13 years 9 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
ICCAD
2008
IEEE
153views Hardware» more  ICCAD 2008»
14 years 4 months ago
Boolean factoring and decomposition of logic networks
This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...
Alan Mishchenko, Robert K. Brayton, Satrajit Chatt...
DAC
2003
ACM
14 years 9 months ago
A new enhanced constructive decomposition and mapping algorithm
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
Alan Mishchenko, Xinning Wang, Timothy Kam
AGIS
2008
319views more  AGIS 2008»
13 years 8 months ago
An Efficient Algorithm for Raster-to-Vector Data Conversion
Data conversion from raster to vector (R2V) is a key function in Geographic Information Systems (GIS) and remote sensing (RS) image processing for integrating GIS and RS data. The...
Junhua Teng, Fahui Wang, Yu Liu
VMV
2001
112views Visualization» more  VMV 2001»
13 years 9 months ago
Generation of Decomposition Hierarchies for Efficient Occlusion Culling of Large Polygonal Models
Efficient handling of large polygonal scenes has always been a challenging task and in recent years, view-frustum and occlusion culling have drawn a lot of attention for accomplis...
Michael Meißner, Dirk Bartz, Gordon Mül...