Articles

Search all Discrete & Computational Geometry articles

Filter by

Volume:

Sort by

Date published:

New to old Old to new

Showing 2,901-2,950 of 2,985 articles

A decomposition theorem on Euclidean Steiner minimal trees
F. K. Hwang
G. D. Song
D. Z. Du
OriginalPaper 01 December 1988 Pages: 367 - 382
The orthogonal convex skull problem
Derick Wood
Chee K. Yap
OriginalPaper 01 December 1988 Pages: 349 - 365
Branched coverings
Bojan Mohar
OriginalPaper 01 December 1988 Pages: 339 - 348
On the complexity of polyhedral separability
Nimrod Megiddo
OriginalPaper 01 December 1988 Pages: 325 - 337
Valuations and polarity
Jim Lawrence
OriginalPaper 01 December 1988 Pages: 307 - 324
A sylvester theorem for conic sections
James A. Wiseman
Paul R. Wilson
OriginalPaper 01 December 1988 Pages: 295 - 305
Computing the link center of a simple polygon
W. Lenhart
R. Pollack
C. Yap
OriginalPaper 01 September 1988 Pages: 281 - 293
Establishing order in planar subdivisions
David G. Kirkpatrick
OriginalPaper 01 September 1988 Pages: 267 - 280
Polyhedral line transversals in space
David Avis
Rephael Wenger
OriginalPaper 01 September 1988 Pages: 257 - 265
Congruence, similarity, and symmetries of geometric objects
Helmut Alt
Kurt Mehlhorn
Emo Welzl
OriginalPaper 01 September 1988 Pages: 237 - 256
Simplified Voronoi diagrams
John Canny
Bruce Donald
OriginalPaper 01 September 1988 Pages: 219 - 236
Lower bounds on moving a ladder in two and three dimensions
Yan Ke
Joseph O'Rourke
OriginalPaper 01 September 1988 Pages: 197 - 217
Guest editor's foreword

EditorialNotes 01 September 1988 Pages: 193 - 195
The algebraic degree of geometric optimization problems
Chanderjit Bajaj
OriginalPaper 01 June 1988 Pages: 177 - 191
Combinatoriald-tori with a large symmetry group
W. Kühnel
G. Lassmann
OriginalPaper 01 June 1988 Pages: 169 - 176
Nonobtuse triangulation of polygons
Brenda S. Baker
Eric Grosse
Conor S. Rafferty
OriginalPaper 01 June 1988 Pages: 147 - 168
Nonorientable genus of nearly complete bipartite graphs
Bojan Mohar
OriginalPaper 01 June 1988 Pages: 137 - 146
Separating two simple polygons by a sequence of translations
R. Pollack
M. Sharir
S. Sifrony
OriginalPaper 01 June 1988 Pages: 123 - 136
On optimal realizations of finite metric spaces by graphs
Ingo Althöfer
OriginalPaper 01 June 1988 Pages: 103 - 122
Arrangements of lines with a minimum number of triangles are simple
Jean-Pierre Roudneff
OriginalPaper 01 June 1988 Pages: 97 - 102
On the contact dimensions of graphs
P. Frankl
H. Maehara
OriginalPaper 01 March 1988 Pages: 89 - 96
Polygonizations of point sets in the plane
Linda Deneen
Gary Shute
OriginalPaper 01 March 1988 Pages: 77 - 87
Repeated Angles inE ₄
George Purdy
OriginalPaper 01 March 1988 Pages: 73 - 75
Tiling the torus and other space forms
Marjorie Senechal
OriginalPaper 01 March 1988 Pages: 55 - 72
On the classification of toric fano varieties
Günter Ewald
OriginalPaper 01 March 1988 Pages: 49 - 54
Planar realizations of nonlinear davenport-schinzel sequences by segments
Ady Wiernik
Micha Sharir
OriginalPaper 01 March 1988 Pages: 15 - 47
Many triangulated spheres
Gil Kalai
OriginalPaper 01 March 1988 Pages: 1 - 14
Steiner minimal trees on sets of four points
D. Z. Du
F. K. Hwang
G. Y. Ting
OriginalPaper 01 December 1987 Pages: 401 - 414
Invertible relations on polytopes
G. T. Sallee
OriginalPaper 01 December 1987 Pages: 395 - 399
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
Chee K. Yap
OriginalPaper 01 December 1987 Pages: 365 - 393
Finite coverings by translates of centrally symmetric convex domains
G. Fejes Tóth
OriginalPaper 01 December 1987 Pages: 353 - 363
A power law for the distortion of planar sets
Michael H. Freedman
OriginalPaper 01 December 1987 Pages: 345 - 351
A lower bound for the optimal crossing-free Hamiltonian cycle problem
Ryan B. Hayward
OriginalPaper 01 December 1987 Pages: 327 - 343
Computing the volume is difficult
Imre Bárány
Zoltán Füredi
OriginalPaper 01 December 1987 Pages: 319 - 326
Balanced subdivision and enumeration in balanced spheres
Louis J. Billera
Katherine E. Magurn
OriginalPaper 01 September 1987 Pages: 297 - 317
σ-Morphic sets of prototiles
Peter Schmitt
OriginalPaper 01 September 1987 Pages: 271 - 295
On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
Daniel Leven
Micha Sharir
OriginalPaper 01 September 1987 Pages: 255 - 270
Direction trees
Robert E. Jamison
OriginalPaper 01 September 1987 Pages: 249 - 254
Generating closed 2-cell embeddings in the torus and the projective plane
D. W. Barnette
OriginalPaper 01 September 1987 Pages: 233 - 247
Tessellations generated by hyperplanes
Rolf Schneider
OriginalPaper 01 September 1987 Pages: 223 - 232
New applications of random sampling in computational geometry
Kenneth L. Clarkson
OriginalPaper 01 June 1987 Pages: 195 - 222
Computing convolutions by reciprocal search
Leonidas J. Guibas
Raimund Seidel
OriginalPaper 01 July 1987 Pages: 175 - 193
Storing the subdivision of a polyhedral surface
David M. Mount
OriginalPaper 01 July 1987 Pages: 153 - 174
ɛ-nets and simplex range queries
David Haussler
Emo Welzl
OriginalPaper 01 July 1987 Pages: 127 - 151
Linear space data structures for two types of range search
Bernard Chazelle
Herbert Edelsbrunner
OriginalPaper 01 July 1987 Pages: 113 - 126
Triangulating point sets in space
David Avis
Hossam ElGindy
OriginalPaper 01 July 1987 Pages: 99 - 111
Guest editor's introduction
David Dobkin
EditorialNotes 01 July 1987 Pages: 97 - 98
On nonnegative solutions of random systems of linear inequalities
Christian Buchta
OriginalPaper 01 March 1987 Pages: 85 - 95
Steiner minimal trees for regular polygons
D. Z. Du
F. K. Hwang
J. F. Weng
OriginalPaper 01 March 1987 Pages: 65 - 84
A criterion for the affine equivalence of cell complexes inR ^d and convex polyhedra inR ^d+1
Franz Aurenhammer
OriginalPaper 01 March 1987 Pages: 49 - 64

Articles

Search

Navigation