Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821865958, 9781470439644

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The densest double-lattice packing of a convex polygon

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/006/17 ◽

1991 ◽

pp. 245-262 ◽

Cited By ~ 1

Author(s):

David Mount

Keyword(s):

Convex Polygon ◽

Lattice Packing

Download Full-text

Winding numbers and the generalized lower-bound conjecture

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/006/13 ◽

1991 ◽

pp. 209-220 ◽

Cited By ~ 1

Author(s):

Carl Lee

Keyword(s):

Lower Bound

Download Full-text

Wu-Ritt characteristic sets and their complexity

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/006/07 ◽

1991 ◽

pp. 111-136 ◽

Cited By ~ 8

Author(s):

G. Gallo ◽

B. Mishra

Keyword(s):

Characteristic Sets

Download Full-text

Recent progress on the complexity of the decision problem for the reals

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/006/20 ◽

1991 ◽

pp. 287-308 ◽

Cited By ~ 6

Author(s):

James Renegar

Keyword(s):

Decision Problem ◽

Recent Progress

Download Full-text

Invariant-theoretic computation in projective geometry

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/006/23 ◽

1991 ◽

pp. 363-378 ◽

Cited By ~ 1

Author(s):

Neil White

Keyword(s):

Projective Geometry

Download Full-text

Sweeping arrangements of curves

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/006/21 ◽

1991 ◽

pp. 309-350 ◽

Cited By ~ 11

Author(s):

Jack Snoeyink ◽

John Hershberger

Download Full-text

On the perimeter of a point set in the plane

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/006/04 ◽

1991 ◽

pp. 67-76 ◽

Cited By ~ 12

Author(s):

Vasilis Capolyeas ◽

János Pach

Keyword(s):

Point Set

Download Full-text

Geometric partitioning and its applications

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/006/01 ◽

1991 ◽

pp. 1-38 ◽

Cited By ~ 3

Author(s):

Pankaj Agarwal

Keyword(s):

Geometric Partitioning

Download Full-text

Notes on geometric graph theory

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/006/19 ◽

1991 ◽

pp. 273-286 ◽

Cited By ~ 16

Author(s):

János Pach

Keyword(s):

Graph Theory ◽

Geometric Graph

Download Full-text

Arrangements in topology

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/006/18 ◽

1991 ◽

pp. 263-272

Author(s):

Peter Orlik

Download Full-text

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

The densest double-lattice packing of a convex polygon

Winding numbers and the generalized lower-bound conjecture

Wu-Ritt characteristic sets and their complexity

Recent progress on the complexity of the decision problem for the reals

Invariant-theoretic computation in projective geometry

Sweeping arrangements of curves

On the perimeter of a point set in the plane

Geometric partitioning and its applications

Notes on geometric graph theory

Arrangements in topology

Discrete and Computational Geometry: Papers from the DIMACS Special Year - DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Latest Publications