756 search results - page 9 / 152 » A new algorithm for Boolean operations on general polygons |
MMSEC
2004
ACM
14 years 1 months ago
2004
ACM
This paper presents a high-capacity method to embed information into the geometry of a 3D polygonal mesh. The method extends a previously reported work, to which several improveme...
AMAI
2000
Springer
13 years 11 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Keyword search for smallest lowest common ancestors (SLCAs) in XML data has recently been proposed as a meaningful way to identify interesting data nodes in XML data where their s...
HPCN
1997
Springer
13 years 11 months ago
1997
Springer
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
VISUALIZATION
1997
IEEE
14 years 5 days ago
1997
IEEE
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...