Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Snoeyink, Jack"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reconstructing polygons from scanner data
Therese Biedl
,
Stephane Durocher
,
Jack Snoeyink
Theoretical Computer Science
412
(32), 2011, pp. 4161-4172
Reconstructing polygons from scanner data
Therese Biedl
,
Stephane Durocher
,
Jack Snoeyink
Lecture Notes in Computer Science
5878
, 2009, pp. 862-871
Computing the implicit Voronoi diagram in triple precision
David L. Millman
,
Jack Snoeyink
Lecture Notes in Computer Science
5664
, 2009, pp. 495-506
Capturing crossings: Convex hulls of segment and plane intersections
Esther M. Arkin
,
Joseph S.B. Mitchell
,
Jack Snoeyink
Information Processing Letters
107
(5), 2008, pp. 194-197
Delineating boundaries for imprecise regions
Iris Reinbacher
,
Marc Benkert
,
Marc van Kreveld
,
Joseph S.B. Mitchell
,
Jack Snoeyink
,
Alexander Wolff
Algorithmica
50
(3), 2008, pp. 386-414
Maximum independent set for intervals by divide and conquer with pruning
Jack Snoeyink
Networks
49
(2), 2007, pp. 158-159
Counting and enumerating pointed pseudotriangulations with the greedy flip algorithm
Hervé Brönnimann
,
Lutz Kettner
,
Michel Pocchiola
,
Jack Snoeyink
SIAM Journal on Computing
36
(3), 2006, pp. 721-739
Rotamer-pair energy calculations using a trie data structure
Andrew Leaver-Fay
,
Brian Kuhlman
,
Jack Snoeyink
LNCS/LNBI
3692
, 2005, pp. 389-400
Mining protein family specific residue packing patterns from protein structure graphs
Jun Huan
,
Wei Wang
,
Deepak Bandyopadhyay
,
Jack Snoeyink
,
Jan Prins
,
Alexander Tropsha
Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology, RECOMB'2004 (San Diego, CA, USA, March 27-31, 2004)
, 2004, pp. 308-315
Computing a
(1+\epsilon)
-approximate geometric minimum-diameter spanning tree
Michael J. Spriggs
,
J. Mark Keil
,
Sergei Bespamyatnikh
,
Michael Segal
,
Jack Snoeyink
Algorithmica
38
(4), 2004, pp. 577-589
On exclusion regions for optimal triangulations
R.L. (Scot) Drysdale
,
Scott McElfresh
,
Jack Scott Snoeyink
Discrete Applied Mathematics
109
(1-2), 2001, pp. 49-65
Compact Voronoi diagrams for moving convex polygons
Leonidas J. Guibas
,
Jack Snoeyink
,
Li Zhang
Lecture Notes in Computer Science
1851
, 2000, pp. 339-352
Queries with segments in Voronoi diagrams
Sergei Bespamyatnikh
,
Jack Snoeyink
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 122-129
Cartographic line simplication and polygon CSG formulae in
O(n \log n)
time
John Hershberger
,
Jack Snoeyink
Lecture Notes in Computer Science
1272
, 1997, pp. 93-103
Linear-time reconstruction of Delaunay triangulations with applications
Jack Snoeyink
,
Marc van Kreveld
Lecture Notes in Computer Science
1284
, 1997, pp. 459-471
Point location
Jack Snoeyink
Handbook of Discrete and Computational Geometry, 1997, pp. 559-574
Optimal algorithms to embed trees in a point set
Prosenjit Bose
,
Michael McAllister
,
Jack Snoeyink
Lecture Notes in Computer Science
1027
, 1996, pp. 64-75
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Timothy M.Y. Chan
,
Jack Snoeyink
,
Chee-Keng Yap
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 282-291
Finding the medial axis of a simple polygon in linear time
Francis Chin
,
Jack Snoeyink
,
Cao An Wang
Lecture Notes in Computer Science
1004
, 1995, pp. 382-391
Computing common tangents without a separating line
David Kirkpatrick
,
Jack Snoeyink
Lecture Notes in Computer Science
955
, 1995, pp. 183-193
Two-and three-dimensional point location in rectangular subdivisions
Mark de Berg
,
Marc van Kreveld
,
Jack Snoeyink
Journal of Algorithms
18
(2), 1995, pp. 256-277
Computing a face in an arrangement of line segments and related problems
Bernard Chazelle
,
Herbert Edelsbrunner
,
Leonidas Guibas
,
Micha Sharir
,
Jack Snoeyink
SIAM Journal on Computing
22
(6), 1993, December, pp. 1286-1302
An efficient algorithm for finding the CSG representation of a simple polygon
David Dobkin
,
Leonidas Guibas
,
John Hershberger
,
Jack Snoeyink
Algorithmica
10
(1), 1993, pp. 1-23
A compact piecewise-linear Voronoi diagram for convex sites in the plane
Michael McAllister
,
David Kirkpatrick
,
Jack Snoeyink
Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, FOCS'93 (Palo Alto, CA, November 3-5, 1993)
, 1993, pp. 573-582
Counting and reporting red/blue segment intersections
Larry Palazzi
,
Jack Snoeyink
Proceedings of the 3rd Workshop on Algorithms and Data Structures. WADS '93 (Montréal, Canada, August 1993)
LNCS 709
, 1993, pp. 530-540
Seiten 1
2
>