Result 241 to 256 of 256 total
Hidden surface removal for $c$-oriented polyhedra. (English)
Comput. Geom. 1, No.5, 247-268 (1992).
241
A general approach to dominance in the plane. (English)
J. Algorithms 13, No.2, 274-296 (1992).
242
Computing and verifying depth orders (English)
Symposium on Computational Geometry, 138-145 (1992).
243
Two- and three-dimensional point location in rectangular subdivisions (Extended abstract) (English)
SWAT, 352-363 (1992).
244
Efficient algorithms for ray shooting and hidden surface removal (English)
Efficient algorithms for ray shooting and hidden surface removal, I-VIII, 1-225 (1992).
245
On rectilinear link distance. (English)
Comput. Geom. 1, No.1, 13-34 (1991).
246
Finding squares and rectangles in sets of points. (English)
BIT 31, No.2, 202-219 (1991).
247
Finding squares and rectangles in sets of points (English)
BIT 31, No. 2, 202-219 (1991).
248
Efficient ray shooting and hidden surface removal (English)
Symposium on Computational Geometry, 21-30 (1991).
249
Shortest path queries in rectilinear worlds of higher dimension (Extended abstract) (English)
Symposium on Computational Geometry, 51-60 (1991).
250
Maintaining range trees in secondary memory. Part I: Partitions. (English)
Acta Inf. 27, No.8, 423-452 (1990).
251
Finding shortest paths in the presence of orthogonal obstacles using a combined L1 and link metric (English)
SWAT, 213-224 (1990).
252
Translating polygons with applications to hidden surface removal (English)
SWAT, 60-70 (1990).
253
Hidden surface removal for axis-parallel polyhedra (Extended abstract) (English)
FOCS, 252-261 (1990).
254
Finding squares and rectangles in sets of points (English)
WG, 341-355 (1989).
255
Dominance in the presence of obstracles (English)
WG, 190-201 (1988).
256
Result 241 to 256 of 256 total
Start
Contact
Print
General Help
