-
1
-
-
84948972138
-
Straight skeletons for general polygonal figures in the plane
-
[AA], LNCS 1090, Springer Verlag
-
[AA] O. Aichholzer and F. Aurenhammer, Straight skeletons for general polygonal figures in the plane, Proc. 2nd COCOON, 1996, 117-126, LNCS 1090, Springer Verlag.
-
(1996)
Proc. 2nd COCOON
, pp. 117-126
-
-
Aichholzer, O.1
Aurenhammer, F.2
-
2
-
-
0000840238
-
A novel type of skeleton for polygons
-
[AAAG]
-
[AAAG] O. Aichholzer, D. Alberts, F. Aurenhammēr, and B. Gartner, A novel type of skeleton for polygons, J. of Universal Computer Science (an electronic journal), 1 (1995), 752-761
-
(1995)
J. of Universal Computer Science (an electronic journal)
, vol.1
, pp. 752-761
-
-
Aichholzer, O.1
Alberts, D.2
Aurenhammēr, F.3
Gartner, B.4
-
3
-
-
84947954392
-
-
[BBDG], these proceedings
-
[BBDG] G. Barequet, A. Briggs, M. Dickerson, and M.T. Goodrich, Offset-polygon annulus placement problems, these proceedings, 1997.
-
(1997)
Offset-polygon annulus placement problems
-
-
Barequet, G.1
Briggs, A.2
Dickerson, M.3
Goodrich, M.T.4
-
4
-
-
84947954393
-
-
[CD], Technical Report PCS-TR86-132, Dept, of Computer Science, Dartmouth College, Hanover, NH 03755, Short version: Proc. 1st Symp. on Comp, Geom., 1985, 324-244
-
[CD] L.P. Chew and R.L. Drysdale, Voronoi diagrams based on convex distance functions, Technical Report PCS-TR86-132, Dept, of Computer Science, Dartmouth College, Hanover, NH 03755, 1986; Short version: Proc. 1st Symp. on Comp, Geom., 1985, 324-244.
-
(1986)
Voronoi diagrams based on convex distance functions
-
-
Chew, L.P.1
Drysdale, R.L.2
-
5
-
-
52449147685
-
A sweepline algorithm for Voronoi diagrams
-
[Fo]
-
[Fo] S. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica, 2 (1987), 153-174.
-
(1987)
Algorithmica
, vol.2
, pp. 153-174
-
-
Fortune, S.1
-
7
-
-
0029291583
-
Tentative prune-and-search for computing fixed-points with applications to geometric computation
-
[KS]
-
[KS] D. Kirkpatrick and J. Snoeyink, Tentative prune-and-search for computing fixed-points with applications to geometric computation, Fund. Informatics, 22 (1995), 353-370.
-
(1995)
Fund. Informatics
, vol.22
, pp. 353-370
-
-
Kirkpatrick, D.1
Snoeyink, J.2
-
8
-
-
0004318419
-
Concrete and abstract Voronoi diagrams
-
[K1], Springer Verlag
-
[K1] R. Klein, Concrete and abstract Voronoi diagrams, LNCS 400, Springer Verlag, 1989.
-
(1989)
LNCS 400
-
-
Klein, R.1
-
9
-
-
0010268561
-
Randomized incremental construction of abstract Voronoi diagrams
-
[KMM]
-
[KMM] R. Klein, K. Mehlhorn, and S. Meiser, Randomized incremental construction of abstract Voronoi diagrams, Comp. Geometry: Theory and Applications, 3 (1993), 157-184.
-
(1993)
Comp. Geometry: Theory and Applications
, vol.3
, pp. 157-184
-
-
Klein, R.1
Mehlhorn, K.2
Meiser, S.3
-
10
-
-
85030235871
-
Voronoi diagrams based on general metrics in the plane
-
[KW], LNCS S94, Springer Verlag
-
[KW] R. Klein and D. Wood, Voronoi diagrams based on general metrics in the plane, Proc. 5th Symp. on Theoret. Aspects in Comp. Sci., 1988, 281-291, LNCS S94, Springer Verlag.
-
(1988)
Proc. 5th Symp. on Theoret. Aspects in Comp. Sci
, pp. 281-291
-
-
Klein, R.1
Wood, D.2
-
11
-
-
0030549637
-
A compact piecewise-linear Voronoi diagram for convex sites in the plane
-
[MKS]
-
[MKS] M. McAllister, D. Kirkpatrick, and J. Snoeyink, A compact piecewise-linear Voronoi diagram for convex sites in the plane, D&CG, 15 (1996), 73-105.
-
(1996)
D&CG
, vol.15
, pp. 73-105
-
-
McAllister, M.1
Kirkpatrick, D.2
Snoeyink, J.3
-
12
-
-
51249177173
-
On the construction of abstract Voronoi diagrams
-
[MMO]
-
[MMO] K. Mehlhorn, S. Meiser, and Ó’Dúnlaing, On the construction of abstract Voronoi diagrams, Discrete & Computational Geometry, 6 (1991), 211-224.
-
(1991)
Discrete & Computational Geometry
, vol.6
, pp. 211-224
-
-
Mehlhorn, K.1
Meiser, S.2
Ó’Dúnlaing3
-
13
-
-
0040340126
-
-
[MMR], Technical Report MPI-I-92-135, Max-Planck-Institut für Informatik, Saarbrücken, Germany
-
[MMR] K. Mehlhorn, S. Meiser, and R. Rasch, Furthest site abstract Voronoi diagrams, Technical Report MPI-I-92-135, Max-Planck-Institut für Informatik, Saarbrücken, Germany.
-
Furthest site abstract Voronoi diagrams
-
-
Mehlhorn, K.1
Meiser, S.2
Rasch, R.3
-
14
-
-
0040340122
-
Computing the furthest site Voronoi diagram for a set of disks
-
[Ra], Springer Verlag
-
[Ra] D. Rappaport, Computing the furthest site Voronoi diagram for a set of disks, Proc. 1st Workshop on Algorithms and Data Structures, LNCS, 382, Springer Verlag, 1989, 57-66.
-
(1989)
Proc. 1st Workshop on Algorithms and Data Structures, LNCS
, vol.382
, pp. 57-66
-
-
Rappaport, D.1
|