Finding the intersection of two convex polyhedra. (English) Zbl 0396.52002


52-04 Software, source code, etc. for problems pertaining to convex and discrete geometry
68Q25 Analysis of algorithms and problem complexity
52Bxx Polytopes and polyhedra


Zbl 0342.68030
Full Text: DOI Link


[1] Shamos, M.I., Computational geometry, (1977), Department of Computer Science, Yale University, to be published by Springer-Verlag.
[2] Shamos, M.I., Geometric complexity, Proc. seventh ann. ACM symp. on theory of computing, 224-233, (May 1975)
[3] Preparata, F.P.; Hong, S.J., Convex hulls of finite sets in two and three dimensions, Commun. ACM, 20, 87-93, (1977) · Zbl 0342.68030
[4] Kung, H.T.; Luccio, F.; Preparata, F.P., On finding the maxima of a set of vectors, J. ACM, 22, 469-476, (1975) · Zbl 0316.68030
[5] Lee, D.T.; Preparata, F.P., Location of a point in a planar subdivision and its applications, SIAM J. comput., 6, 594-606, (1977) · Zbl 0357.68034
[6] Preparata, F.P., Steps into computational geometry, (), Location of a set of points in a planar subdivision (submitted for publication); Available in · Zbl 0365.68053
[7] Ewald, G., Geometry: an introduction, (1971), Wadsworth Belmont, Ca · Zbl 0292.50001
[8] Stoer, J.; Witzgall, C., Convexity and optimization in finite dimensions, I, (1970), Springer-Verlag Berlin · Zbl 0203.52203
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.