Computational geometry in a curved world
- 1 June 1990
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 5 (1-4) , 421-457
- https://doi.org/10.1007/bf01840397
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Decomposition and intersection of simple splinegonsAlgorithmica, 1988
- Recipes for geometry and numerical analysis - Part I: an empirical studyPublished by Association for Computing Machinery (ACM) ,1988
- Algorithms for planar geometric modelsPublished by Springer Nature ,1988
- Intersection of convex objects in two and three dimensionsJournal of the ACM, 1987
- Sorting jordan sequences in linear time using level-linked search treesInformation and Control, 1986
- A linear algorithm for determining the separation of convex polyhedraJournal of Algorithms, 1985
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- Finding the convex hull of a simple polygonJournal of Algorithms, 1983
- An Optimal Algorithm for Finding the Kernel of a PolygonJournal of the ACM, 1979