ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 4 of 1,394,228
|
|
|
1
|
|
Tight bounds for dynamic convex hull queries (again)
|
|
June 2007
|
|
SCG '07: Proceedings of the twenty-third annual symposium on Computational geometry
|
Publisher: ACM
 Request Permissions
|
|
Full text available: |
 Pdf
(374.00 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 8, Downloads (12 Months): 44, Downloads (Overall): 173, Citation Count: 0 |
 |
|
The dynamic convex hull problem was recently solved in O(lg n) time per operation, and this result is best possible in models of computation with bounded branching (e.g., algebraic computation trees). From a data structures point of view, however, such ...
Keywords: bounded precision, dynamic convex hull, word RAM
|
|
2
|
|
Dynamic Planar Convex Hull
|
|
November 2002
|
|
FOCS '02: Proceedings of the 43rd Symposium on Foundations of Computer Science
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 18 |
|
|
In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log ...
Keywords: Planar computational geometry, dynamic convex hull, lower bound, data structure, search trees, finger searches
|
|
3
|
|
Kinetic collision detection with fast flight plan changes
|
|
December 2004
|
|
Information Processing Letters
, Volume 92 Issue 6
|
|
Publisher: Elsevier North-Holland, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
We show how to augment a kinetic data structure for collision detection between translating polygons with the ability to make fast flight plan changes. This allows us to update the KDS after a moving polygon changes its motion in O(log n) time, ...
Keywords: collision detection, computational geometry, dynamic convex hull, kinetic data structure
|
|
4
|
|
Cartographic line simplification and polygon CSG formulæ in O(n log* n) time
|
|
December 1998
|
|
WADS '97: Selected papers presented at the international workshop on Algorithms and data structure
|
|
Publisher: Elsevier Science Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 3 |
|
|
|
Keywords: dynamic convex hull, path hull, simple polygon
|
Also published in: |
| December 1998 |
Computational Geometry: Theory and Applications |
Volume 11 Issue 3-4 |
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Refine by Keywords
Save results to a Binder
Publisher Site