Chazelle, B., Edelsbrunner, H., Guibas, L.,J., Sharir, M. A singly-exponential stratification scheme for real semi-algebraic varieties and its applications, Proc. 16th Internat. Colloq. on Automata, Languages and Programming (1989), 179-193.

Digital Library

Google Scholar

[5]

Chazelle, B., Friedman, J. A deterministic view of random sampling and its use in geometry, Combinatorica 10 (1990).

Google Scholar

[6]

Chazelle, B., Palios,L. Triangulating a non-convex polytope, Proc. 5th ACM Symp. Comput. Geom. (1989), 393-400.

Digital Library

Google Scholar

[7]

Chazelle, B., Welzl, E. Quasi-optimal range searching in spaces of finite Vapnik Chervonenkis dimension, Disc. Comput. Geom. 4 (1989), 467--489.

Digital Library

Google Scholar

[8]

Clarkson, K. Applications of random sampling in computational geometry, Disc. Comput. Geom. 2 (1987), 195-222.

Digital Library

Google Scholar

[9]

Clarkson, K. A randomized algorithm for closest-point queries, SIAM J. Comput. 17 (1988), 830-847.

Digital Library

Google Scholar

[10]

Clarkson, K., Edelsbrunner, H., Guibas, L.J., Sharir, M., Welzl, E. "Combinatorial complexity bounds for arrangements of curves and surfaces, Proc. 29th A.nn. IEEE Syrup. Found. Comput. Sci. (1988), 568-579.

Google Scholar

[11]

Clarkson, K., Shor, P. Applications of random sampling in computational geometry, Disc. Comput. Geom. 4 (1989), 387--421.

Digital Library

Google Scholar

[12]

Cole, R. Searching and storing similar lists, J. Algorithms 7 (1986), 202-220.

Digital Library

Google Scholar

[13]

Cole, It., Yap, C.K. Geometric retrieval problems, Inform. and Control 63 (1984), 39-57.

Digital Library

Google Scholar

[14]

Edelsbrunner, H. Algorithms in Combinatorial Geometry, Springer-Vedag, Heidelberg 1987.

Digital Library

Google Scholar

[15]

Edelsbrunner, H. The upper envelope of piecewise linear functions: Tight bounds on the number of faces, Disc. Comput. Geom. 4 (1989), 337-343.

Digital Library

Google Scholar

[16]

Edelsbrunner, H., Guibas, L.J., Hershberger, J., Seidel, It., Sharir, M., Snoeyink, J., Wdzl, E. Implicitly representing arrangements of lines or segments, Proc. 4th ACM Syrup. Comput. Geom. (1988), 56-69.

Digital Library

Google Scholar

[17]

Edelsbrunner, H., Guibas, L.J., Sharir, M. The upper envelope of piecewise linear functions: Algorithms and applications, Disc. Comput. Geom. 4 (1989), 311-336.

Digital Library

Google Scholar

[18]

Edelsbrunner, H., O'Rourke, J., Seidel, It. Constructing arrangements of lines and hyperplanes with applications, SIAM J. Comput. 15 (1986), 341-363.

Digital Library

Google Scholar

[19]

Edelsbrunner, H., Welzl, E. Haifplanar range search in linear space and O(n~'eas) query time, Inform. Process. Lett. 23 (1986), 289-293.

Digital Library

Google Scholar

[20]

Haussler, D., Welzl, E. Epsilon nets and simplex range queries, Disc. Comput. Geom. 2 (1987), 127- 151.

Digital Library

Google Scholar

[21]

Mehlhorn, K. Data structures and algorithms 8." Multi~Iimensional Searching and Computational Geometry, Springer-Veflag (1984).

Digital Library

Google Scholar

[22]

Path, J., Sharir, M. The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates, Disc. Comput. Geom. 4 (1989), 291-309.

Digital Library

Google Scholar

[23]

Paterson, M., Yao, F.F. Point retrieval for polygons, J. Algorithms 7 (1986), 441--447.

Crossref

Google Scholar

[24]

Pollack, R., Sharir, M., Sifrony, S. Separating two simple polygons by a sequence of translations, Disc. Comput. Geom. 3 (1988), 123-136.

Digital Library

Google Scholar

[25]

winard, D.E. Polygon retrieval, SIAM J. Comput. i1 (1982), 149-165.

Google Scholar

[26]

Yao, F.F. A 3-space partition and its applications, Proe. 15th Ann. AGM Syrup. Theory Comput. (~983), 25s-263.

Digital Library

Google Scholar

[27]

Yao, A.C., Yao, F.F. A general approach to d-dimensional geometric queries, Proc. 17th Ann. ACM Syrup. Theory Comput. (1985), 163-168.

Digital Library

Google Scholar

Cited By

View all

KONAGAYA MASANO T(2013)Reporting All Segment Intersections Using an Arbitrary Sized Work SpaceIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.E96.A.1066E96.A:6(1066-1071)Online publication date: 2013
https://doi.org/10.1587/transfun.E96.A.1066
Chen DWang H(2011)Improved Points Approximation Algorithms Based on Simplicial Thickness Data StructuresCombinatorial Algorithms10.1007/978-3-642-19222-7_36(363-376)Online publication date: 2011
https://doi.org/10.1007/978-3-642-19222-7_36
Chen DWang H(2010)Improved points approximation algorithms based on simplicial thickness data structuresProceedings of the 21st international conference on Combinatorial algorithms10.5555/1987042.1987078(363-376)Online publication date: 26-Jul-2010
https://dl.acm.org/doi/10.5555/1987042.1987078
Show More Cited By

Index Terms

Quasi-optimal upper bounds for simplex range searching and new zone theorems
1. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Quasi-optimal upper bounds for simplex range searching and new zone theorems
Abstract
This paper presents quasi-optimal upper bounds for simplex range searching. The problem is to preprocess a setP ofn points in ℜ^d so that, given any query simplexq, the points inP ∩q can be counted or reported efficiently. Ifm units of storage are ...
Read More
New upper bounds and exact methods for the knapsack sharing problem

A new upper bound is proposed for the knapsack sharing problem.A new dichotomous search-based exact algorithm is proposed.The new algorithm outperforms a most recent exact algorithm of the literature and the Cplex solver V 12. In this paper, we study ...
Read More
Two New Bounds for the Random-Edge Simplex-Algorithm

We prove that the RANDOM-EDGE simplex-algorithm requires an expected number of at most $13n/\sqrt{d}$ pivot steps on any simple $d$-polytope with $n$ vertices. This is the first nontrivial upper bound for general polytopes. We also describe a refined ...
Read More

Comments

Information & Contributors

Information

Published In

SCG '90: Proceedings of the sixth annual symposium on Computational geometry

May 1990

371 pages

ISBN:0897913620

DOI:10.1145/98524

Chairman:
Raimund Seidel

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 May 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SOCG

Sponsor:

SOCG: 6th Annual Conference on Computational Geometry

June 7 - 9, 1990

California, Berkley, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

38
Total Citations
View Citations
58
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)1

Other Metrics

View Author Metrics

Citations

Cited By

View all

KONAGAYA MASANO T(2013)Reporting All Segment Intersections Using an Arbitrary Sized Work SpaceIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.E96.A.1066E96.A:6(1066-1071)Online publication date: 2013
https://doi.org/10.1587/transfun.E96.A.1066
Chen DWang H(2011)Improved Points Approximation Algorithms Based on Simplicial Thickness Data StructuresCombinatorial Algorithms10.1007/978-3-642-19222-7_36(363-376)Online publication date: 2011
https://doi.org/10.1007/978-3-642-19222-7_36
Chen DWang H(2010)Improved points approximation algorithms based on simplicial thickness data structuresProceedings of the 21st international conference on Combinatorial algorithms10.5555/1987042.1987078(363-376)Online publication date: 26-Jul-2010
https://dl.acm.org/doi/10.5555/1987042.1987078
Chambers EErickson JWorah PTeillaud M(2008)Testing contractibility in planar rips complexesProceedings of the twenty-fourth annual symposium on Computational geometry10.1145/1377676.1377721(251-259)Online publication date: 9-Jun-2008
https://dl.acm.org/doi/10.1145/1377676.1377721
Pellegrini M(2005)Repetitive hidden-surface-removal for polyhedral scenesAlgorithms and Data Structures10.1007/3-540-57155-8_278(541-552)Online publication date: 9-Jun-2005
https://doi.org/10.1007/3-540-57155-8_278
Agarwal PMatoušek J(2005)On range searching with semialgebraic setsMathematical Foundations of Computer Science 199210.1007/3-540-55808-X_1(1-13)Online publication date: 30-Jul-2005
https://doi.org/10.1007/3-540-55808-X_1
Chazelle BRosenberg B(2005)Lower bounds on the complexity of simplex range reporting on a pointer machineAutomata, Languages and Programming10.1007/3-540-55719-9_95(439-449)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-55719-9_95
Welzl E(2005)On spanning trees with low crossing numbersData structures and efficient algorithms10.1007/3-540-55488-2_30(233-249)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-55488-2_30
Eppstein DErickson J(1994)Iterated nearest neighbors and finding minimal polytopesDiscrete & Computational Geometry10.5555/3116647.283035311:1(321-350)Online publication date: 1-Dec-1994
https://dl.acm.org/doi/10.5555/3116647.2830353
Eppstein DErickson J(1994)Iterated nearest neighbors and finding minimal polytopesDiscrete & Computational Geometry10.5555/2830326.283035311:3(321-350)Online publication date: 1-Dec-1994
https://dl.acm.org/doi/10.5555/2830326.2830353
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

Quasi-optimal upper bounds for simplex range searching and new zone theorems

New upper bounds and exact methods for the knapsack sharing problem

Two New Bounds for the Random-Edge Simplex-Algorithm

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

Quasi-optimal upper bounds for simplex range searching and new zone theorems

New upper bounds and exact methods for the knapsack sharing problem

Two New Bounds for the Random-Edge Simplex-Algorithm

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