Article

Free access

Dynamization of geometric data structures

Authors:

O. Fries,

K. Mehlhorn,

St. NäherAuthors Info & Claims

SCG '85: Proceedings of the first annual symposium on Computational geometry

Pages 168 - 176

https://doi.org/10.1145/323233.323256

Published: 01 June 1985 Publication History

PDF eReader

References

[1]

{1} B. Chazelle, L. Guibas: "Fractional Cascading" ICALP 85, to appear.

Google Scholar

[2]

{2} H. Edelsbrunner, L. J. Guibas, I. Stolfi: "Optimal Point Location in a Monotone Subdivision" DEC System Research Report No. 2, Palo Alto.

Google Scholar

[3]

{3} S. Huddleston, K. Mehlhorn: "A new Representation for Linear Lists" Acta Informatica 17, 157-184 (1982).

Digital Library

Google Scholar

[4]

{4} H. Imai, T. Asano: "Dynamic Segment Intersection with Applications" 25th FOCS 1984, 393-402.

Google Scholar

[5]

{5} D. Kirkpatrick: "Optimal Search in Planar Subdivisions" SICOMP 12 (1983), 28-35.

Digital Library

Google Scholar

[6]

{6} R. Lipton, R. E. Tarjan: "Applications of a Planar Separator Theorem" 18th FOCS, 1977, 162-170.

Google Scholar

[7]

{7} D. T. Lee, F. P. Preparata: "Location of a Point in a Planar Subdivision and its Applications" SIAM J. of Computing, Vol 6, no 3, 1977, 594-606.

Digital Library

Google Scholar

[8]

{8} G. S. Lueker: "A Data Structure for Orthogonal Range Queries" 19th FOCS, 1978, 28-34.

Google Scholar

[9]

{9} D. Maier, S. C. Salveter: "Hysterical B-Trees" Stony Brook, cs Dep. TR #79/007.

Google Scholar

[10]

{10} K. Mehlhorn: "Data Structures and Algorithms", Vol 1: Sorting and Searching, Vol 2: Graph-Algorithms and NP-completeness, Vol 3: Multidimensional Searching and Computational Geometry, Springer Publ. Comp. 1984.

Digital Library

Google Scholar

[11]

{11} V. K. Vaishnavi, D. Wood: "Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization" Journal of Algorithms, Vol 3 (1982), 160-176.

Crossref

Google Scholar

[12]

{12} D. E. Willard: "New Data Structures for Orthogonal Queries" SIAM J. of Computing, 1985.

Digital Library

Google Scholar

[13]

{13} D. E. Willard: "New Data Structures for Orthogonal Range Queries" Technical Report, Harvard University, 1978.

Google Scholar

[14]

{14} P. v. Emde Boas, R. Kaas, E. Zijlstra: "Design and Implementation of an efficient priority queue" Math. Systems Theory, 10, 1977, 99-127.

Crossref

Google Scholar

[15]

{15} W. Lipski: "Finding a Manhattan Path and Related Problems" Networks 13, 1983, 399-409.

Google Scholar

Cited By

View all

Sen S(2005)Fractional cascading simplifiedAlgorithm Theory — SWAT '9210.1007/3-540-55706-7_18(212-220)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-55706-7_18
Preparata F(2005)Planar point location revisited (A guided tour of a decade of research)Foundations of Software Technology and Theoretical Computer Science10.1007/3-540-50517-2_67(1-17)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-50517-2_67
Tamassia R(2005)A dynamic data structure for planar graph embeddingAutomata, Languages and Programming10.1007/3-540-19488-6_143(576-590)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-19488-6_143
Show More Cited By

Index Terms

Recommendations

Geometric data structures
Geometric Data Structures on a Reconfigurable Mesh, with Applications
IPPS '97: Proceedings of the 11th International Symposium on Parallel Processing

We present several geometric data structures and algorithms for problems for a planar set of rectangles and bipartitioning problems for a point set in two dimensions on a reconfigurable mesh of size n\times n. The problems for rectangles include ...
Geometric separability using orthogonal objects
Highlights
- An efficient algorithm for bichromatic separability for rectangular and square annuli.
Abstract
Given a bichromatic point set P = R ∪ B of red and blue points, a separator is an object of a certain type that separates R and B. We study the geometric separability problem when the separator is a) rectangular annulus of fixed ...

Comments

Information & Contributors

Information

Published In

SCG '85: Proceedings of the first annual symposium on Computational geometry

June 1985

322 pages

ISBN:0897911636

DOI:10.1145/323233

Chairman:
Joseph O'Rourke
Johns Hopkins Univ., Baltimore, MD

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1985

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SCG85

Sponsor:

SCG85: The 1st Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry 1985

June 5 - 7, 1985

Maryland, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
298
Total Downloads

Downloads (Last 12 months)31
Downloads (Last 6 weeks)9

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sen S(2005)Fractional cascading simplifiedAlgorithm Theory — SWAT '9210.1007/3-540-55706-7_18(212-220)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-55706-7_18
Preparata F(2005)Planar point location revisited (A guided tour of a decade of research)Foundations of Software Technology and Theoretical Computer Science10.1007/3-540-50517-2_67(1-17)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-50517-2_67
Tamassia R(2005)A dynamic data structure for planar graph embeddingAutomata, Languages and Programming10.1007/3-540-19488-6_143(576-590)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-19488-6_143
Willard DAlbany S(2005)Lower bounds for dynamic range query problems that permit subtraction (extended abstract)Automata, Languages and Programming10.1007/3-540-16761-7_94(444-453)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-16761-7_94
Chiang YPreparata FTamassia RRamachandran V(1993)A unified approach to dynamic point location, ray shooting, and shortest paths in planar mapsProceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms10.5555/313559.313610(44-53)Online publication date: 1-Jan-1993
https://dl.acm.org/doi/10.5555/313559.313610
Goodrich MTamassia RYap C(1993)Dynamic ray shooting and shortest paths via balanced geodesic triangulationsProceedings of the ninth annual symposium on Computational geometry10.1145/160985.161157(318-327)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/160985.161157
Chiang YTamassia R(1992)Dynamic algorithms in computational geometryProceedings of the IEEE10.1109/5.16340980:9(1412-1434)Online publication date: Jan-1992
https://doi.org/10.1109/5.163409
Mulmuley KSen S(1992)Dynamic point location in arrangements of hyperplanesDiscrete & Computational Geometry10.1007/BF022930528:3(335-360)Online publication date: 1-Dec-1992
https://dl.acm.org/doi/10.1007/BF02293052
Mulmuley KSen SDrysdale R(1991)Dynamic point location in arrangements of hyperplanesProceedings of the seventh annual symposium on Computational geometry10.1145/109648.109663(132-141)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/109648.109663
Mulmuley KDrysdale R(1991)Randomized multidimensional search trees (extended abstract)Proceedings of the seventh annual symposium on Computational geometry10.1145/109648.109662(121-131)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/109648.109662
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Geometric data structures

Geometric Data Structures on a Reconfigurable Mesh, with Applications

Geometric separability using orthogonal objects

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Geometric data structures

Geometric Data Structures on a Reconfigurable Mesh, with Applications

Geometric separability using orthogonal objects

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations