Canonical Form Computation
Canonical Form Computation is a method in Constructive Solid Geometry that systematically reduces complex geometric representations into a unique, standardized form through Boolean operations and spatial decomposition, thereby enabling unambiguous comparison and manipulation of solid models.
499
Publications
24.9K
Citations
839
Authors
465
Institutions
Publications per year
2017–2026
73
Parents
499
Improved simulation of stabilizer circuits
Scott Aaronson, Daniel Gottesman · Physical Review A · 2004 · 1.6K citations · Full text
Efficient implementation of a BDD package
Karl S. Brace, Richard Rudell, Randal E. Bryant · 1990 · 1.1K citations · Full text
Canonical and principal components of shape
J. N. Darroch, James E. Mosimann · Biometrika · 1985 · 483 citations
1–5 of 499
839
5
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 839
465

Centre National de la Recherche Scientifique
Paris, France
11 h-index
17 publications
1.1K citations
University of California, Berkeley
Berkeley, United States
11 h-index
21 publications
5.1K citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
11 publications
3.5K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
6 h-index
8 publications
359 citations
HUN-REN Institute for Computer Science and Control
Budapest, Hungary
6 h-index
11 publications
408 citations
The University of Tokyo
Tokyo, Japan
6 h-index
9 publications
327 citations

Hungarian Academy of Sciences
Budapest, Hungary
6 h-index
11 publications
408 citations
University of Southern California
Los Angeles, United States
5 h-index
7 publications
224 citations
1–8 of 465
23 publications · 1.4K citations
16
h-index
19 publications · 1.2K citations
15
h-index
JHEP · 14 publications · 851 citations
14
h-index
13 publications · 486 citations
12
h-index
9 publications · 291 citations
10
h-index
1–5