Approximate vertex enumeration
The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull problem. We introduce ‘approximate vertex enumeration’ as the problem to compute the vertices of a polytope wh...
Furkejuvvon:
| Váldodahkki: | |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Carleton University
2023-12-01
|
| Ráidu: | Journal of Computational Geometry |
| Liŋkkat: | https://jocg.org/index.php/jocg/article/view/3327 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|