13.21 H. Geometry

Chapter Contents (Back)

13.21.1 H.1. General; Miscellaneous; Convexity, etc.

Chapter Contents (Back)

Proceedings Of The Second Annual Symposium On Computational Geometry (Yorktown Heights, Ny,
JUNE 2-4, 1986).

Goodman, J.E., Pollack, R.,
Discrete And Computational Geometry, Springer,
BERLIN, 1986ff. BibRef

Boltjansky, V., Gohberg, I.T.,
Results And Problems In Combinatorial Geometry, Cambridge University Press, Cambridge,
UK(86), pp. 1985. BibRef

Lee, D.T., Ching, Y.T.,
The Power Of Geometric Duality Revisited,
IPL(21), 1985, pp. 117-122. BibRef

Dobkin, D.P., Munro, J.I.,
Efficient Uses Of The Past,
J. ALGORITHMS(6), 1985, pp. 455-465. BibRef

Pyo, S.S., Suk, M., Nagbhushan, V.,
Systolic Implementation Of A Geometry Processor,
CAPAIDM(86), pp. 328-334. BibRef

Toussaint, G.T.,
New Results In Computational Geometry Relevant To Pattern Recognition In Practice,
PRIP(II), pp. 135-146. BibRef

Edelsbrunner, H.,
Constructing Belts In Two-Dimensional Arrangements With Applications,
SIAM JC(15), 1986, pp. 271-284. BibRef

Edelsbrunner, H., O'Rourke, J., Seidel, R.,
Constructing Arrangements Of Lines And Hyperplanes With Applications,
SIAM JC(15), 1986, pp. 341-363. BibRef

Greene, D.H., Yao, F.F.,
Finite-Resolution Computational Geometry,
SFCS(86), pp. 143-152. BibRef

O'Rourke, J.,
Finding Minimal Enclosing Boxes,
JCIS(14), 1985, pp. 183-199. BibRef

Evans, D.J., Mai, S.W.,
Two Parallel Algorithms For The Convex Hull Problem In A Two Dimensional Space,
PC(2), 1985, pp. 313-326. BibRef

Klee, V., Laskowski, M.C.,
Finding The Smallest Triangles Containing A Given Convex Polygon,
J. ALGORITHMS(6), 1985, pp. 359-375. BibRef

Stojmenovic, I., Soisalon-Soininen, E.,
A Note On Approximate Convex Hulls,
IPL(22), 1986, pp. 55-56. BibRef

Ghosh, S.K.,
A Note On Convex Hull Algorithms,
PR(19), 1986, pp. 75-. BibRef

Kallay, M.,
Convex Hull Made Easy,
IPL(22), 1986, pp. 161-. BibRef

O'Rourke, J., Aggarwal, A., Maddila, S., Baldwin, M.,
An Optimal Algorithm For Finding Minimal Enclosing Triangles,
J. ALGORITHMS(7), 1986, pp. 258-269. BibRef

Atallah, M.J.,
Computing The Convex Hull Of Line Intersections,
J. ALGORITHMS(7), 1986, pp. 285-288. BibRef

Kirkpatrick, D.G., Seidel, R.,
The Ultimate Planar Convex Hull Algorithm,
SIAM JC(15), 1986, pp. 287-294. BibRef

Shin, S.Y., Woo, T.C.,
Finding The Convex Hull Of A Simple Polygon In Linear Time,
PR(19), 1986, pp. 453-458. BibRef

Chapter on Rosenfeld Bibliography for 1986 continues in
H.2. Distance, etc. .

Last update:Jun 7, 2018 at 10:14:50