11.20 H. Geometry

Chapter Contents (Back)

11.20.1 H.1. General and miscellaneous

Chapter Contents (Back)

Proceedings Of The Fourth Annual Symposium On Computational Geometry (Urbana-Champaign, Il, June 6-8, 1988), Acm Press,
NEW YORK, 1988.

Toussaint, G.T.,
Computational Morphology, North-Holland,
AMSTERDAM, 1988. BibRef

Toussaint, G.T.,
Guest Ed., Computational Geometry,
VC 3(), No. 6, May 1988, pp. 321-388. BibRef

Yap, C.K.,
Guest Ed., Special Issue: Acm Symposium On Computational Geometry, Waterloo,
DCG 3(), No. 3, 1988, pp. 193-293. BibRef

O'Rourke, J.,
Computational Geometry Column #3,
COMPUTER GRAPHICS(21), 1987, pp. 314-315. BibRef

O'Rourke, J.,
The Computational Geometry Column #4,
COMPUTER GRAPHICS(22), 1988, pp. 111-112. BibRef

Chazelle, B.,
An Algorithm For Segment-Dragging And Its Implementation,
ALGORITHMICA(3), 1988, pp. 205-221. BibRef

Bhasker, J., Sahni, S.,
A Linear Algorithm To Find A Rectangular Dual Of A Planar Triangulated Graph,
ALGORITHMICA(3), 1988, pp. 247-278. BibRef

Aggarwal, A., Chazelle, B., Guibas, L., O'Dunlaing, C., Yap, C.,
Parallel Computational Geometry,
ALGORITHMICA(3), 1988, pp. 293-327. BibRef

Karlsson, R.G., Overmars, M.H.,
Scanline Algorithms On A Grid,
BIT(28), 1988, pp. 227-241. BibRef

Deneen, L., Shute, G.,
Polygonizations Of Point Sets In The Plane,
DCG(3), 1988, pp. 77-87. BibRef

Alt, H., Mehlhorn, K., Wagener, H., Welzl, E.,
Congruence, Similarity, And Symmetries Of Geometric Objects,
DCG(3), 1988, pp. 237-256. BibRef

Kirkpatrick, D.G.,
Establishing Order In Planar Subdivisions,
DCG(3), 1988, pp. 267-280. BibRef

Karlsson, R.G., Overmars, M.H.,
Normalized Divide-And-Conquer: A Scaling Technique For Solving Multi-Dimensional Problems,
IPL(26), 1988, pp. 307-312. BibRef

Katz, M.D., Volper, D.J.,
Geometric Retrieval In Parallel,
JPDC(5), 1988, pp. 92-102. BibRef

Lu, M., Varman, P.,
Optimal Algorithms For Rectangle Problems On A Mesh-Connected Computer,
JPDC(5), 1988, pp. 154-171. BibRef

Asano, T., Umeo, H.,
Systolic Algorithms For Computing The Visibility Polygon And Triangulation Of A Polygonal Region,
PC(6), 1988, pp. 209-216. BibRef

Stojmenovic, I., Miyakawa, M.,
An Optimal Parallel Algorithm For Solving The Maximal Elements Problem In The Plane,
PC(7), 1988, pp. 249-251. BibRef

Dehne, F.,
Solving Visibility And Separability Problems On A Mesh-Of-Processors,
VC(3), 1988, pp. 356-370. BibRef

Clarkson, K.L.,
Application Of Random Sampling In Computational Geometry, Ii,
CG(88), pp. 1-11. BibRef

Edelsbrunner, H., Guibas, L.J., Sharir, M.,
The Complexity Of Many Faces In Arrangements Of Lines And Of Segments,
CG(88), pp. 44-55. BibRef

Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., Welzl, E.,
Implicitly Representing Arrangements Of Lines Or Segments,
CG(88), pp. 56-69. BibRef

Buchberger, B.,
Algebraic Methods For Non-Linear Computational Geometry,
CG(88), pp. 81-82. BibRef

Ericson, L.W., Yap, C.K.,
The Design Of Linetool, A Geometric Editor,
CG(88), pp. 83-92. BibRef

Dobkin, D., Silver, D.,
Recipes For Geometry And Numerical Analysis-Part I: An Empirical Study,
CG(88), pp. 93-105. BibRef

Hoffmann, C.M., Hopcroft, J.E., Karasick, M.S.,
Towards Implementing Robust Geometric Computations,
CG(88), pp. 106-117. BibRef

Edelsbrunner, H., Mucke, E.P.,
Simulation Of Simplicity: A Technique To Cope With Degenerate Cases In Geometric Algorithms,
CG(88), pp. 118-133. BibRef

Yap, C.K.,
A Geometric Consistency Theorem For A Symbolic Perturbation Scheme,
CG(88), pp. 134-142. BibRef

Cole, R., Goodrich, M.T.,
Optimal Parallel Algorithms For Polygon And Point-Set Problems,
CG(88), pp. 201-210. BibRef

Chapter on Rosenfeld Bibliography for 1988 continues in
H.2. Convexity, visibility, intersections, .

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