NDLI: Small-size relative (p,ε)-approximations for well-behaved range spaces

Please wait, while we are loading the content...

A simple aggregative algorithm for counting triangulations of planar point sets and related problems

Efficiently hex-meshing things with topology

On a forgotten conjecture from a famous paper of Erdös

Graph induced complex on point data

Kinetic data structures for all nearest neighbors and closest pair in the plane

Recent progress on the combinatorial diameter of polyhedra and simplicial complexes

Complexity analysis of random geometric structures made simpler

On the 2-sum embedding conjecture

Range counting coresets for uncertain data

Counting and sampling minimum cuts in genus g graphs

Putting the turing into manufacturing: recent developments in algorithmic automation

A new approach to output-sensitive voronoi diagrams and delaunay triangulations

Ramsey-type results for semi-algebraic relations

Polyominoes on twisted cylinders

On soft predicates in subdivision motion planning

Zigzag zoology: rips zigzags for homology inference

Measuring similarity between curves on 2-manifolds via homotopy area

A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates

Localized delaunay refinement for piecewise-smooth complexes

On planar point sets with the pentagon property

Homological reconstruction and simplification in $R^{3}$

Kinetic 2-centers in the black-box model

Union of random minkowski sums and network vulnerability analysis

Diverse near neighbor problem

Small-size relative (p,ε)-approximations for well-behaved range spaces

Topological graphs: empty triangles and disjoint matchings

A fast algorithm for well-spaced points and approximate delaunay graphs

Sharp bounds on Davenport-Schinzel sequences of every order

Interactive visualization of 3D configuration spaces

A near-optimal algorithm for shortest paths among curved obstacles in the plane

Geometry in the space of persistence modules

Lower bounds for k-distance approximation

A faster algorithm for computing motorcycle graphs

A parallel algorithm for computing the flow complex

Equal coefficients and tolerance in coloured tverberg partitions

Parameterized complexity of discrete morse theory

Competitive query strategies for minimising the ply of the potential locations of moving points

The maximum number of faces of the minkowski sum of three convex polytopes

Compressive sensing using locality-preserving matrices

A constant-factor approximation for multi-covering with disks

Bichromatic compatible matchings

Fast segment insertion and incremental construction of constrained delaunay triangulations

Capture bounds for visibility-based pursuit evasion

Parametric search visualization

Computing shortest paths among curved obstacles in the plane

Computing closed essential surfaces in knot complements

Systems of distant representatives in euclidean space

The graphs of planar soap bubbles

Hyperbolic delaunay complexes and voronoi diagrams made practical

Improved bounds for incidences between points and circles

Triangulating unknown environments using robot swarms

The complexity of separating points in the plane

A new approach to crushing 3-manifold triangulations

Robust geometric spanners

Point guards and point clouds: solving general art gallery problems

Small-size relative (p,ε)-approximations for well-behaved range spaces

Content Provider	ACM Digital Library
Author	Ezra, Esther E.
Abstract	We present improved upper bounds for the size of relative (p,ε)-approximation for range spaces with the following property: For any (finite) range space projected onto (that is, restricted to) a ground set of size n and for any parameter 1 ≤ k ≤ n, the number of ranges of size at most k is only nearly-linear in n and polynomial in k. Such range spaces are called "well behaved". Our bound is an improvement over the bound $O(log(1/p)/ε^{2}$ p) introduced by Li et. al. [17] for the general case (where this bound has been shown to be tight in the worst case), when p l ε. We also show that such small size relative (p,ε)-approximations can be constructed in expected polynomial time. Our bound also has an interesting interpretation in the context of "p-nets": As observed by Har-Peled and Sharir [13], p-nets are special cases of relative (p,ε)-approximations. Specifically, when ε is a constant smaller than 1, the analysis in [13, 17] implies that there are p-nets of size O(log{(1/p)}/p) that are also relative approximations. In this context our construction significantly improves this bound for well-behaved range spaces. Despite the progress in the theory of p-nets and the existence of improved bounds corresponding to the cases that we study, these bounds do not necessarily guarantee a bounded relative error. Lastly, we present several geometric scenarios of well-behaved range spaces, and show the resulting bound for each of these cases obtained as a consequence of our analysis. In particular, when ε is a constant smaller than 1, our bound for points and axis-parallel boxes in two and three dimensions, as well as points and "fat" triangles in the plane, matches the optimal bound for p-nets introduced in [3, 25].
Starting Page	233
Ending Page	242
Page Count	10
File Format	PDF
ISBN	9781450320313
DOI	10.1145/2462356.2462363
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-06-17
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Lovász local lemma Relative approximations Well-behaved range spaces
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in