Skip to search formSkip to main contentSkip to account menu

Boolean operations on polygons

Known as: Boolean operation 
Boolean operations on polygons are a set of Boolean operations (AND, OR, NOT, XOR, ...) operating on one or more sets of polygons in computer… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
A-bufferBoolean algebraClipping (computer graphics)Computational geometry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Computing in memory with FeFETs
Data transfer between a processor and memory frequently represents a bottleneck with respect to improving application-level… 
2011
2011
Boolean Operations on Polygons by Using Trapezoidal Decomposition
A new algorithm for Boolean operations is presented,which incorporates trapezoidal decomposition.The involved polygons are… 
Highly Cited
2009
Highly Cited
2009
A new algorithm for computing Boolean operations on polygons
2009
2009
Quotient Complexity of Closed Languages
A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and… 
Highly Cited
2002
Highly Cited
2002
Source-based' heterogeneous solid modeling
Highly Cited
1999
Highly Cited
1999
Extending the CSG Tree. Warping, Blending and Boolean Operations in an Implicit Surface Modeling System
Automatic blending has characterized the major advantage of implicit surface modeling systems. Recently, the introduction of… 
Highly Cited
1993
Highly Cited
1993
Weak islands and an algebraic semantics for scope taking
Modifying the descriptive and theoretical generalizations of Relativized Minimality, we argue that a significant subset of weak… 
Highly Cited
1990
Highly Cited
1990
Path-based scheduling for synthesis
  • R. Camposano
  • Twenty-Third Annual Hawaii International…
  • 1990
  • Corpus ID: 14997736
A path-based scheduling algorithm for synchronous digital systems is presented. It yields solutions with the minimum number of… 
Highly Cited
1975
Highly Cited
1975
Probabilistic Treatment of General Combinational Networks
In this correspondence two methods are given for calculating the probability that the output of a general combinational network… 
Highly Cited
1971
Highly Cited
1971
Characterizations of locally testable events
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)