Name
Abstract | ||
|---|---|---|
This work is aimed at developing an efficient data structure for representing symbolically convex polyhedra. We introduce an original data structure, the Decomposed Convex Polyhedron (DCP), that is closed under intersection and linear transformations, and allows to check inclusion, equality, and emptiness. The main feature of DCPs lies in their ability to represent concisely polyhedra that can be expressed as combinations of simpler sets, which can overcome combinatorial explosion in high dimensional spaces. DCPs also have the advantage of being reducible into a canonical form, which makes them efficient for representing simple sets constructed by long sequences of manipulations, such as those handled by state-space exploration tools. Their practical efficiency has been evaluated with the help of a prototype implementation, with promising results. |
Year | Venue | Field |
|---|---|---|
2018 | ATVA | Discrete mathematics,Data structure,Computer science,DCPS,Polyhedron,Regular polygon,Canonical form,Convex polytope,Linear map,Combinatorial explosion |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
14 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernard Boigelot | 1 | 707 | 48.59 |
| Isabelle Mainz | 2 | 1 | 1.03 |