AAAAAA
Results:
1-11
|
Results: 11
Authors:
Speckmann, B
Snoeyink, J
Citation: B. Speckmann et J. Snoeyink, Easy triangle strips for TIN terrain models, INT J GEO I, 15(4), 2001, pp. 379-386
Authors:
Isenburg, M
Snoeyink, J
Citation: M. Isenburg et J. Snoeyink, Spirale Reversi: Reverse decoding of the Edgebreaker encoding, COMP GEOM, 20(1-2), 2001, pp. 39-52
Authors:
Gold, C
Snoeyink, J
Citation: C. Gold et J. Snoeyink, A one-step crust and skeleton extraction algorithm, ALGORITHMIC, 30(2), 2001, pp. 144-163
Authors:
Bespamyatnikh, S
Snoeyink, J
Citation: S. Bespamyatnikh et J. Snoeyink, Queries with segments in Voronoi diagrams, COMP GEOM, 16(1), 2000, pp. 23-33
Authors:
Boissonnat, JD
Snoeyink, J
Citation: Jd. Boissonnat et J. Snoeyink, Efficient algorithms for line and curve segment intersection using restricted predicates, COMP GEOM, 16(1), 2000, pp. 35-52
Authors:
Bespamyatnikh, S
Kirkpatrick, D
Snoeyink, J
Citation: S. Bespamyatnikh et al., Generalizing ham sandwich cuts to equitable subdivisions, DISC COM G, 24(4), 2000, pp. 605-622
Authors:
Kahan, S
Snoeyink, J
Citation: S. Kahan et J. Snoeyink, On the bit complexity of minimum link paths: Superquadratic algorithms forproblem solvable in linear time, COMP GEOM, 12(1-2), 1999, pp. 33-44
Authors:
Kirkpatrick, D
Snoeyink, J
Citation: D. Kirkpatrick et J. Snoeyink, Computing constrained shortest segments: Butterfly wingspans in logarithmic time, INT J C GEO, 9(1), 1999, pp. 53-62
Authors:
Snoeyink, J
Citation: J. Snoeyink, Cross-ratios and angles determine a polygon, DISC COM G, 22(4), 1999, pp. 619-631
Authors:
Chin, F
Snoeyink, J
Wang, CA
Citation: F. Chin et al., Finding the medial axis of a simple polygon in linear time, DISC COM G, 21(3), 1999, pp. 405-420
Authors:
Hershberger, J
Snoeyink, J
Citation: J. Hershberger et J. Snoeyink, Cartographic line simplification and polygon CSG formulae in O(n log n) time, COMP GEOM, 11(3-4), 1998, pp. 175-185
Risultati:
1-11
|