CAD Adjacency Computation Using Validated Numerics

04/22/2017
by   Adam Strzebonski, et al.
0

We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operations e.g. closure, boundary, connected components, and topological properties e.g. homology groups. Other applications include visualization and path planning. Our algorithm determines cell adjacency information using validated numerical methods similar to those used in CAD construction, thus computing CAD with adjacency information in time comparable to that of computing CAD without adjacency information. We report on implementation of the algorithm and present empirical data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2023

Iterated Resultants in CAD

Cylindrical Algebraic Decomposition (CAD) by projection and lifting requ...
research
06/05/2023

B-rep Matching for Collaborating Across CAD Systems

Large Computer-Aided Design (CAD) projects usually require collaboration...
research
03/30/2020

Hyperplane arrangements in polymake

Hyperplane arrangements form the latest addition to the zoo of combinato...
research
10/05/2018

Integrating CAD and Numerical Analysis: 'Dirty Geometry' handling using the Finite Cell Method

This paper proposes a computational methodology for the integration of C...
research
01/03/2022

GAT-CADNet: Graph Attention Network for Panoptic Symbol Spotting in CAD Drawings

Spotting graphical symbols from the computer-aided design (CAD) drawings...
research
07/11/2022

SkexGen: Autoregressive Generation of CAD Construction Sequences with Disentangled Codebooks

We present SkexGen, a novel autoregressive generative model for computer...
research
06/28/2023

Finding the connected components of the graph using perturbations of the adjacency matrix

The problem of finding the connected components of a graph is considered...

Please sign up or login with your details

Forgot password? Click here to reset