Enhancements to Lazard’s Method for Cylindrical Algebraic Decomposition

Author(s):  
Christopher W. Brown ◽  
Scott McCallum
2002 ◽  
Vol 34 (2) ◽  
pp. 145-157 ◽  
Author(s):  
George E. Collins ◽  
Jeremy R. Johnson ◽  
Werner Krandick

2019 ◽  
Vol 13 (4) ◽  
pp. 461-488 ◽  
Author(s):  
Zongyan Huang ◽  
Matthew England ◽  
David J. Wilson ◽  
James Bridge ◽  
James H. Davenport ◽  
...  

Author(s):  
FRANCO CHIAVETTA ◽  
VITO DI GESÙ ◽  
ROSALIA RENDA

In this paper, a parallel algorithm for analyzing connected components in binary images is described. It is based on the extension of the Cylindrical Algebraic Decomposition (CAD) to a two-dimensional (2D) discrete space. This extension allows us to find the number of connected components, to determine their connectivity degree, and to solve the visibility problem. The parallel implementation of the algorithm is outlined and its time/space complexity is given.


2020 ◽  
Vol 100 ◽  
pp. 11-37 ◽  
Author(s):  
Gereon Kremer ◽  
Erika Ábrahám

Sign in / Sign up

Export Citation Format

Share Document