13.21.4 H.4. Search, Intersection, etc.

Chapter Contents (Back)

Cole, R., Yap, C.K.,
Geometric Retrival Problems,
IC (63), 1984, pp. 39-57. BibRef

Guting, R.H.,
Dynamic C-Oriented Polygonal Intersection Searching,
IC(63), 1984, pp. 143-163. BibRef

Guting, R.H.,
Fast Dynamic Intersection Searching In A Set Of Isothetic Line Segments,
IPL(21), 1985, pp. 165-171. BibRef

Supowit, K.J.,
Decomposing A Set Of Points Into Chains, With Applications To Permutation And Circle Graphs,
IPL(21), 1985, pp. 249-252. BibRef

Chazelle, B., Drysdale, R.L., Lee, D.T.,
Computing The Largest Empty Rectangle,
SIAM JC(15), 1986, pp. 300-315. BibRef

Dobkin, D.P., Kirkpatrick, D.G.,
A Linear Algorithm For Determining The Separation Of Convex Polyhedra,
J. ALGORITHMS(6), 1985, pp. 381-392. BibRef

Megiddo, N.,
Partitioning With Two Lines In The Plane,
J. ALGORITHMS(6), 1985, pp. 430-433. BibRef

Edelsbrunner, H., Overmars, M.H.,
Batched Dynamic Solutions To Decomposable Searching Problems,
J. ALGORITHMS(6), 1985, pp. 515-542. BibRef

Chazelle, B.M., Lee, D.T.,
On A Circle Placement Problem,
COMPUTING(36), 1986, pp. 1-16. BibRef

Widmayer, P., Wu, Y.F., Schlag, M.D.F., Wong, C.K.,
On Some Union And Intersection Problems For Polygons With Fixed Orientations,
COMPUTING(36), 1986, pp. 183-197. BibRef

Veldhorst, M.,
The Optimal Representation Of Disjoint Iso-Oriented Rectangles In Two-Dimensional Trees,
J. ALGORITHMS(7), 1986, pp. 1-34. BibRef

Paterson, M.S.,
Point Retrieval For Polygons,
J. ALGORITHMS(7), 1986, pp. 441-447. BibRef

Chazelle, B., Preparata, F.P.,
Halfspace Range Search: An Algorithmic Application Of K-Sets,
DCG(1), 1986, pp. 83-93. BibRef

Welzl, E.,
More On K-Sets Of Finite Sets In The Plane,
DCG(1), 1986, pp. 95-100. BibRef

Edelsbrunner, H.,
Edge-Skeletons In Arrangements With Applications,
ALGORITHMICA(1), 1986, pp. 93-109. BibRef

Chazelle, B., Guibas, L.J.,
Fractional Cascading: I. A Data Structuring Technique,
ALGORITHMICA(1), 1986, pp. 133-162. BibRef

Chazelle, B., Guibas, L.J.,
Fractional Cascading: Ii. Applications,
ALGORITHMICA(1), 1986, pp. 163-191. BibRef

Chazelle, B.,
Reporting And Counting Segment Intersections,
JCSS(32), 1986, pp. 156-182. BibRef

Hoffmann, K., Mehlhorn, K., Rosenstiehl, P., Tarjan, R.E.,
Sorting Jordan Sequences In Linear Time Using Level-Linked Search Trees,
IC(68), 1986, pp. 170-184. BibRef

Tamminen, M.,
Constructing Maximal Slicings From Geometry,
ACTA INFORMATICA(23), 1986, pp. 267-288. BibRef

Ottmann, T., Wood, D.,
Space-Economical Plane-Sweep Algorithms,
CVGIP(34), 1986, pp. 35-51. BibRef

Edelsbrunner, H., Guibas, L.J., Stolfi, J.,
Optimal Point Location In A Monotone Subdivision,
SIAM JC(15), 1986, pp. 317-340. BibRef

Imai, H., Asano, T.,
Efficient Algorithms For Geometric Graph Search Problems,
SIAM JC(15), 1986, pp. 478-494. BibRef

Haussler, D., Welzl, E.,
Epsilon-Nets And Simplex Range Queries,
CG(86), pp. 61-71. BibRef

Willard, D.E.,
On The Application Of Sheared Retrival To Orthogonal Range Queries,
CG(86), pp. 80-89. BibRef

Guibas, L.J., Seidel, R.,
Computing Convolutions By Reciprocal Search,
CG(86), pp. 90-99. BibRef

Klein, R., Nurmi, O., Ottmann, T., Wood, D.,
Optimal Dynamic Solutions For Fixed Windowing Problems,
CG(86), pp. 109-115. BibRef

Atallah, M.J., Goodrich, M.T.,
Efficient Plane Sweeping In Parallel,
CG(86), pp. 216-225. BibRef

Aggarwal, A., Klawe, M.M., Moran, S., Shor, P., Wilber, R.,
Geometric Applications Of A Matrix Searching Algorithm,
CG(86), pp. 285-292. BibRef

Chazelle, B., Edelsbrunner, H.,
Linear Space Data Structures For Two Types Of Range Search,
CG(86), pp. 293-302. BibRef

Motwani, R., Raghavan, P.,
Deferred Data Structuring: Query-Driven Preprocessing For Geometric Search Problems,
CG(86), pp. 303-312. BibRef

Kitchen, L.J., Callahan, M.,
Optimal Cell Size For Efficient Retrieval Of Sparse Data By Approximate 2d Position Using A Coarse Spatial Array,
CVPR(86), pp. 357-361. BibRef

Fisk, S.,
Separating Point Sets By Circles, And The Recognition Of Digital Disks,
T-PAMI(8), 1986, pp. 554-556. BibRef

Sarnak, N., Tarjan, R.E.,
Planar Point Location Using Persistent Search Trees,
COMM. ACM(29), 1986, pp. 669-679. BibRef

Oommen, B.J.,
A Learning Automaton Solution To The Stochastic Minimum-Spanning Circle Problem,
T-SMC(16), 1986, pp. 598-603. BibRef

Dyer, M.E.,
On A Multidimensional Search Technique And Its Application To The Euclidean One-Centre Problem,
SIAM JC(15), 1986, pp. 725-738. BibRef

Chazelle, B.,
Lower Bounds On The Complexity Of Multidimensional Searching,
SFCS(86), pp. 87-96. BibRef

Wiernik, A.,
Planar Realizations Of Nonlinear Davenport-Schinzel Sequences By Segments,
SFCS(86), pp. 97-106. BibRef

Katz, M.D., Volper, D.J.,
Data Structures For Retrieval On Square Grids,
SIAM JC(15), 1986, pp. 919-931. BibRef

Chapter on Rosenfeld Bibliography for 1986 continues in
H.5. Packing, covering, etc. .

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