15.8.6 H.6. Convexity, straightness, visibility, hulls,

Chapter Contents (Back)
decompositions, etc.

Hu, T.C., Shing, M.T.,
An O(N) Algorithm To Find A Near-Optimum Partition Of A Convex Polygon,
J. ALGORITHMS(2), 1981, pp. 122-138. BibRef

ElGindy, H., Avis, D.,
A Linear Algorithm For Computing The Visibility Polygon From A Point,
J. ALGORITHMS(2), 1981, pp. 186-197. BibRef

ElGindy, H., Avis, D., Toussaint, G.,
Applications Of A Two-Dimensional Hidden-Line Algorithm To Other Geometric Problems,
COMPUTING(31), 1983, pp. 191-202. BibRef

Nicholl, T.M., Lee, D.T., Liao, Y.Z., Wong, C.K.,
On The X-Y Convex Hull Of A Set Of X-Y Polygons,
BIT(23), 1983, pp. 456-471. BibRef

Toussaint, G.T.,
On The Application Of The Convex Hull To Histogram Analysis In Threshold Selection,
PRL(2), 1983, pp. 75-77. BibRef

Graham, R.L., Yao, F.F.,
Finding The Convex Hull Of A Simple Polygon,
J. ALGORITHMS(4), 1983, pp. 324-331. BibRef

Akl, S.G.,
Optimal Parallel Algorithms For Computing Convex Hulls And For Sorting,
COMPUTING(33), 1984, pp. 1-11. BibRef

Allison, D.C., Noga, M.T.,
Some Performance Tests Of Convex Hull Algorithms,
BIT(24), 1984, pp. 2-13. BibRef

Ottmann, T., Soisalon-Soininen, E., Wood, D.,
On The Definition And Computation Of Rectilinear Convex Hulls,
INFORMATION SCIENCES(33), 1984, pp. 157-171. BibRef

Kallay, M.,
The Complexity Of Incremental Convex Hull Algorithms In R(D),
IPL(19), 1984, pp. 197 -. BibRef

Soisalon-Soininen, E., Wood, D.,
Optimal Algorithms To Compute The Closure Of A Set Of Iso-Rectangles,
J ALGORITHMS(5), 1984, pp. 199-214. BibRef

Ghosh, S.K., Shyamasundar, R.K.,
A Linear Time Algorithm For Computing The Convex Hull Of An Ordered Crossing Polygon,
PR(17), 1984, pp. 351-358. BibRef

Bhattacharya, B.K., ElGindy, H.,
A New Linear Convex Hull Algorithm For Simple Polygons,
T-IT(30), 1984, pp. 85-88. BibRef

Toussaint, G.T.,
A New Linear Algorithm For Triangulating Monotone Polygons,
PRL(2), 1984, pp. 155-158. BibRef

Post, M.J.,
Minimum Spanning Ellipsoids,
STOC(84), pp. 108-116. BibRef

Cole, R., Sharir, M., Yap, C.K.,
On K-Hulls And Related Problems,
STOC(84), pp. 154-166. BibRef

Hung, S.H.Y., Kasvand, T.,
On The Chord Property And Its Equivalences,
7ICPR(84), pp. 116-119. BibRef

Ghosh, S.K., Shyamasundar, R.K.,
A Linear Time Algorithm For Computing The Visibility Polygon From An Edge,
7ICPR(84), pp. 471-474. BibRef

Anderson, T.A., Kim, C.E.,
Representation Of Digital Line Segments And Their Preimages,
7ICPR(84), pp. 501-504. BibRef

Dorst, L., Smeulders, A.N.M.,
Discrete Representation Of Straight Lines,
T-PAMI(6), 1984, pp. 450-463. BibRef

Edelsbrunner, H., O'Rourke, J., Welzl, E.,
Stationing Guards In Rectilinear Art Galleries,
CVGIP(27), 1984, pp. 167-176. BibRef

Dorst, L., Duin, R.P.W.,
Spirograph Theory: A Framework For Calculations On Digitized Straight Lines,
T-PAMI(6), 1984, pp. 632-639. BibRef

Chapter on Rosenfeld Bibliography for 1984 continues in
I. Texture .

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