11.20.2 H.2. Convexity, visibility, intersections,

Chapter Contents (Back)
search, etc.

Dobkin, D.P., Souva'ine, D.L., Van Wyk, C.J.,
Decomposition And Intersection Of Simple Splinegons,
ALGORITHMICA(3), 1988, pp. 473-485. BibRef

Atallah, M.J., Goodrich, M.T.,
Parallel Algorithms For Some Functions Of Two Convex Polygons,
ALGORITHMICA(3), 1988, pp. 535-548. BibRef

Joe, B., Simpson, R.B.,
Corrections To Lee'S Visibility Polygon Algorithm,
BIT(27), 1987, pp. 458-473. BibRef

Mannila, H., Wood, D.,
A Note On The Largest Empty Rectangle Problem,
BIT(28), 1988, pp. 179-183. BibRef

Zubiaga, R.B.,
On The Intersection Of Two Planar Polygons,
C&G(12), 1988, pp. 401-403. BibRef

Widmayer, P., Wood, D.,
A Time- And Space-Optimal Algorithm For Boolean Mask Operations For Orthogonal Polygons,
CVGIP(41), 1988, pp. 14-27. BibRef

Wiernik, A., Sharir, M.,
Planar Realizations Of Nonlinear Davenport-Schinzel Sequences,
DCG(3), 1988, pp. 15-47. BibRef

Avis, D., Wenger, R.,
Polyhedral Line Transversals In Space,
DCG(3), 1988, pp. 257-265. BibRef

Wood, D., Yap, C.K.,
The Orthogonal Convex Skull Problem,
DCG(3), 1988, pp. 349-365. BibRef

Melkman, A.A.,
On-Line Construction Of The Convex Hull Of A Simple Polyline,
IPL(25), 1987, pp. 11-12. BibRef

Shen, X., Edelsbrunner, H.,
A Tight Lower Bound On The Size Of Visibility Graphs,
IPL(26), 1987, pp. 61-64. BibRef

Goodrich, M.T.,
Finding The Convex Hull Of A Sorted Point Set In Parallel,
IPL(26), 1987, pp. 173-179. BibRef

Matousek, J.,
Line Arrangements And Range Search,
IPL(27), 1988, pp. 275-280. BibRef

Chin, W.P., Ntafos, S.,
Optimum Watchman Routes,
IPL(28), 1988, pp. 39-44. BibRef

Dehne, F., Stojmenovic, I.,
An O(N) Time Algorithm For The Ecdf Searching Problem For Arbitrary Dimensions On A Mesh-Of-Processors,
IPL(28), 1988, pp. 67-70. BibRef

Wang, D.W., Kuo, Y.S.,
A Study On Two Geometric Location Problems,
IPL(28), 1988, pp. 281-286. BibRef

Reichling, M.,
On The Detection Of A Common Intersection Of K Convex Objects In The Plane,
IPL(29), 1988, pp. 25-29. BibRef

Overmars, M.H.,
Efficient Data Structures For Range Searching On A Grid,
J. ALGORITHMS(9), 1988, pp. 254-275. BibRef

Overmars, M.H., Wood, D.,
On Rectangular Visibility,
J. ALGORITHMS(9), 1988, pp. 372-390. BibRef

Brinn, L.W.,
An Application Of Linear Programming To Object Location In R Dimensions,
PRL(7), 1988, pp. 51-57. BibRef

Chazelle, B.,
A Functional Approach To Data Structures And Its Use In Multidimensional Searching,
SIAM JC(17), 1988, pp. 427-462. BibRef

Edelsbrunner, H., Skiena, S.S.,
Probing Convex Polygons With X-Rays,
SIAM JC(17), 1988, pp. 870-882. BibRef

Miller, R., Stout, Q.F.,
Efficient Parallel Convex Hull Algorithms,
T-COMP(37), 1988, pp. 1605-1618. BibRef

Houthuys, P.,
Box Sort, A Multidimensional Binary Sorting Method For Rectangular Boxes, Used For Quick Range Searching,
VC(3), 1987, pp. 236-249. BibRef

Dean, J.A., Lingas, A., Sack, J.R.,
Recognizing Polygons, Or How To Spy,
VC(3), 1988, pp. 344-355. BibRef

Clarkson, K.L., Shor, P.W.,
Algorithms For Diametral Pairs And Convex Hulls That Are Optimal, Randomized, And Incremental,
CG(88), pp. 12-17. BibRef

Welzl, E.,
Partition Trees For Triangle Counting And Other Range Searching Problems,
CG(88), pp. 23-33. BibRef

Golin, M., Sedgewick, R.,
Analysis Of A Simple Yet Efficient Convex Hull Algorithm,
CG(88), pp. 153-163. BibRef

Overmars, M.H., Welzl, E.,
New Methods For Computing Visibility Graphs,
CG(88), pp. 164-171. BibRef

Dobkin, D.P., Edelsbrunner, H., Overmars, M.H.,
Searching For Empty Convex Polygons,
CG(88), pp. 224-228. BibRef

Miller, R., Stout, Q.F.,
Convexity Algorithms For Parallel Machines,
CVPR(88), pp. 918-924. BibRef

Avis, D., Rappaport, D.,
Computing Monotone Simple Circuits In The Plane,
CM(88), pp. 13-23. BibRef

Rawlins, G.J.E., Wood, D.,
Ortho-Convexity And Its Generalizations,
CM(88), pp. 137-152. BibRef

Sack, J.R., Toussaint, G.T.,
Guard Placement In Rectilinear Polygons,
CM(88), pp. 153-175. BibRef

Murakami, K., Koshimizu, H., Hasegawa, K.,
An Algorithm To Extract Convex Hull On O-K Hough Transform Space,
ICPR(88), pp. 500-503. BibRef

Chapter on Rosenfeld Bibliography for 1988 continues in
H.3. Separability, covering, decomposition, .

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