AAAAAA

   
Results: 1-16 |
Results: 16
VISIBILITY WITH MULTIPLE REFLECTIONS
Authors: ARONOV B DAVIS AR DEY TK PAL SP PRASAD DC
Citation: B. Aronov et al., VISIBILITY WITH MULTIPLE REFLECTIONS, Discrete & computational geometry, 20(1), 1998, pp. 61-78
VISIBILITY WITH ONE REFLECTION
Authors: ARONOV B DAVIS AR DEY TK PAL SP PRASAD DC
Citation: B. Aronov et al., VISIBILITY WITH ONE REFLECTION, Discrete & computational geometry, 19(4), 1998, pp. 553-574
ON LEVELS IN ARRANGEMENTS OF LINES, SEGMENTS, PLANES, AND TRIANGLES
Authors: AGARWAL PK ARONOV B CHAN TM SHARIR M
Citation: Pk. Agarwal et al., ON LEVELS IN ARRANGEMENTS OF LINES, SEGMENTS, PLANES, AND TRIANGLES, Discrete & computational geometry, 19(3), 1998, pp. 315-331
MINKOWSKI-TYPE THEOREMS AND LEAST-SQUARES CLUSTERING
Authors: AURENHAMMER F HOFFMANN F ARONOV B
Citation: F. Aurenhammer et al., MINKOWSKI-TYPE THEOREMS AND LEAST-SQUARES CLUSTERING, Algorithmica, 20(1), 1998, pp. 61-76
QUASI-PLANAR GRAPHS HAVE A LINEAR NUMBER OF EDGES
Authors: AGARWAL PK ARONOV B PACH J POLLACK R SHARIR M
Citation: Pk. Agarwal et al., QUASI-PLANAR GRAPHS HAVE A LINEAR NUMBER OF EDGES, Combinatorica, 17(1), 1997, pp. 1-9
THE UNION OF CONVEX POLYHEDRA IN 3 DIMENSIONS
Authors: ARONOV B SHARIR M TAGANSKY B
Citation: B. Aronov et al., THE UNION OF CONVEX POLYHEDRA IN 3 DIMENSIONS, SIAM journal on computing, 26(6), 1997, pp. 1670-1688
STAR UNFOLDING OF A POLYTOPE WITH APPLICATIONS
Authors: AGARWAL PK ARONOV B OROURKE J SCHEVON CA
Citation: Pk. Agarwal et al., STAR UNFOLDING OF A POLYTOPE WITH APPLICATIONS, SIAM journal on computing, 26(6), 1997, pp. 1689-1713
COMPUTING ENVELOPES IN 4 DIMENSIONS WITH APPLICATIONS
Authors: AGARWAL PK ARONOV B SHARIR M
Citation: Pk. Agarwal et al., COMPUTING ENVELOPES IN 4 DIMENSIONS WITH APPLICATIONS, SIAM journal on computing, 26(6), 1997, pp. 1714-1732
ON TRANSLATIONAL MOTION PLANNING OF A CONVEX POLYHEDRON IN 3-SPACE
Authors: ARONOV B SHARIR M
Citation: B. Aronov et M. Sharir, ON TRANSLATIONAL MOTION PLANNING OF A CONVEX POLYHEDRON IN 3-SPACE, SIAM journal on computing, 26(6), 1997, pp. 1785-1803
CAN VISIBILITY GRAPHS BE REPRESENTED COMPACTLY
Authors: AGARWAL PK ALON N ARONOV B SURI S
Citation: Pk. Agarwal et al., CAN VISIBILITY GRAPHS BE REPRESENTED COMPACTLY, Discrete & computational geometry, 12(3), 1994, pp. 347-365
CASTLES IN THE AIR REVISITED
Authors: ARONOV B SHARIR M
Citation: B. Aronov et M. Sharir, CASTLES IN THE AIR REVISITED, Discrete & computational geometry, 12(2), 1994, pp. 119-150
ON THE NUMBER OF MINIMAL-1-STEINER TREES
Authors: ARONOV B BERN M EPPSTEIN D
Citation: B. Aronov et al., ON THE NUMBER OF MINIMAL-1-STEINER TREES, Discrete & computational geometry, 12(1), 1994, pp. 29-34
ON THE SUM OF SQUARES OF CELL COMPLEXITIES IN HYPERPLANE ARRANGEMENTS
Authors: ARONOV B MATOUSEK J SHARIR M
Citation: B. Aronov et al., ON THE SUM OF SQUARES OF CELL COMPLEXITIES IN HYPERPLANE ARRANGEMENTS, J COMB TH A, 65(2), 1994, pp. 311-321
THE FURTHEST-SITE GEODESIC VORONOI DIAGRAM
Authors: ARONOV B FORTUNE S WILFONG G
Citation: B. Aronov et al., THE FURTHEST-SITE GEODESIC VORONOI DIAGRAM, Discrete & computational geometry, 9(3), 1993, pp. 217-255
AN INVARIANT PROPERTY OF BALLS IN ARRANGEMENTS OF HYPERPLANES
Authors: ARONOV B NAIMAN DQ PACH J SHARIR M
Citation: B. Aronov et al., AN INVARIANT PROPERTY OF BALLS IN ARRANGEMENTS OF HYPERPLANES, Discrete & computational geometry, 10(4), 1993, pp. 421-425
SELECTING DISTANCES IN THE PLANE
Authors: AGARWAL PK ARONOV B SHARIR M SURI S
Citation: Pk. Agarwal et al., SELECTING DISTANCES IN THE PLANE, Algorithmica, 9(5), 1993, pp. 495-514
Risultati: 1-16 |