
arXiv: 1704.06856
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.
20 pages
Computer Science - Symbolic Computation, G.4, Computational Geometry (cs.CG), FOS: Computer and information sciences, I.1.2; G.4, Computer Science - Computational Geometry, 68W30, Symbolic Computation (cs.SC), I.1.2
Computer Science - Symbolic Computation, G.4, Computational Geometry (cs.CG), FOS: Computer and information sciences, I.1.2; G.4, Computer Science - Computational Geometry, 68W30, Symbolic Computation (cs.SC), I.1.2
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
