Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

9781595937056

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Happy endings for flip graphs

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 ◽

10.1145/1247069.1247084 ◽

2007 ◽

Cited By ~ 1

Author(s):

David Eppstein

Download Full-text

Kinetic KD-trees and longest-side KD-trees

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 ◽

10.1145/1247069.1247133 ◽

2007 ◽

Cited By ~ 1

Author(s):

Mohammad Ali Abam ◽

Mark de Berg ◽

Bettina Speckmann

Download Full-text

Thick non-crossing paths and minimum-cost flows in polygonal domains

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 ◽

10.1145/1247069.1247079 ◽

2007 ◽

Cited By ~ 14

Author(s):

Valentin Polishchuk ◽

Joseph S.B. Mitchell

Keyword(s):

Minimum Cost ◽

Polygonal Domains ◽

Minimum Cost Flows

Download Full-text

Bi-criteria linear-time approximations for generalized k-mean/median/center

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 ◽

10.1145/1247069.1247073 ◽

2007 ◽

Cited By ~ 4

Author(s):

Dan Feldman ◽

Amos Fiat ◽

Micha Sharir ◽

Danny Segev

Keyword(s):

Linear Time

Download Full-text

Optimal simplification of polygonal chain for rendering

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 ◽

10.1145/1247069.1247102 ◽

2007 ◽

Cited By ~ 3

Author(s):

Lilian Buzer

Keyword(s):

Polygonal Chain

Download Full-text

A space-optimal data-stream algorithm for coresets in the plane

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 ◽

10.1145/1247069.1247071 ◽

2007 ◽

Cited By ~ 7

Author(s):

Pankaj K. Agarwal ◽

Hai Yu

Keyword(s):

Data Stream

Download Full-text

Weak ε-nets have basis of size o(1/ε log (1/ε)) in any dimension

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 ◽

10.1145/1247069.1247113 ◽

2007 ◽

Cited By ~ 1

Author(s):

Saurabh Ray ◽

Nabil Mustafa

Download Full-text

Finding curvature-constrained paths that avoid polygonal obstacles

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 ◽

10.1145/1247069.1247080 ◽

2007 ◽

Cited By ~ 9

Author(s):

Jonathan Backer ◽

David Kirkpatrick

Download Full-text

Between umbra and penumbra

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 ◽

10.1145/1247069.1247117 ◽

2007 ◽

Cited By ~ 1

Author(s):

Julien Demouth ◽

Olivier Devillers ◽

Hazel Everett ◽

Marc Glisse ◽

Sylvain Lazard ◽

...

Download Full-text

On approximate range counting and depth

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 ◽

10.1145/1247069.1247129 ◽

2007 ◽

Cited By ~ 1

Author(s):

Peyman Afshani ◽

Timothy M. Chan

Download Full-text

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Happy endings for flip graphs

Kinetic KD-trees and longest-side KD-trees

Thick non-crossing paths and minimum-cost flows in polygonal domains

Bi-criteria linear-time approximations for generalized k-mean/median/center

Optimal simplification of polygonal chain for rendering

A space-optimal data-stream algorithm for coresets in the plane

Weak ε-nets have basis of size o(1/ε log (1/ε)) in any dimension

Finding curvature-constrained paths that avoid polygonal obstacles

Between umbra and penumbra

On approximate range counting and depth

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07
Latest Publications