Intersecting two polyhedra one of which is convex
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 534-542
- https://doi.org/10.1007/bfb0028837
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Finding extreme points in three dimensions and solving the post-office problem in the planeInformation Processing Letters, 1985
- Space sweep solves intersection of convex polyhedraActa Informatica, 1984
- Computational GeometryPublished by Springer Nature ,1984
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Fast triangulation of simple polygonsLecture Notes in Computer Science, 1983
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978