The complexity of cutting complexes
- 1 March 1989
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 4 (2) , 139-181
- https://doi.org/10.1007/bf02187720
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Topologically sweeping an arrangementPublished by Association for Computing Machinery (ACM) ,1986
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- A convex 3-complex not simplicially isomorphic to a strictly convex complexMathematical Proceedings of the Cambridge Philosophical Society, 1980