WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Discrete & Computational Geometry
  2. Discrete & Computational Geometry : Volume 55
  3. Discrete & Computational Geometry : Volume 55, Issue 3, April 2016
  4. On the Odd Area of Planar Sets
Loading...

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

Discrete & Computational Geometry : Volume 57
Discrete & Computational Geometry : Volume 56
Discrete & Computational Geometry : Volume 55
Discrete & Computational Geometry : Volume 55, Issue 4, June 2016
Discrete & Computational Geometry : Volume 55, Issue 3, April 2016
About f-Vectors of Inscribed Simplicial Polytopes
Configurations of Non-crossing Rays and Related Problems
Interlacement of Double Curves of Immersed Spheres
Generalizations of the Szemerédi–Trotter Theorem
Fractional and j-Fold Coloring of the Plane
Reconstruction of the Geometric Structure of a Set of Points in the Plane from Its Geometric Tree Graph
On the Densest Packing of Polycylinders in Any Dimension
Better Bounds for Planar Sets Avoiding Unit Distances
Combinatorially Two-Orbit Convex Polytopes
On the Diameter of Lattice Polytopes
Polycyclic Movable 4-Configurations are Plentiful
On the Odd Area of Planar Sets
Packing Convex Bodies by Cylinders
A Simple Proof of the Shallow Packing Lemma
Discrete & Computational Geometry : Volume 55, Issue 2, March 2016
Discrete & Computational Geometry : Volume 55, Issue 1, January 2016
Discrete & Computational Geometry : Volume 54
Discrete & Computational Geometry : Volume 53
Discrete & Computational Geometry : Volume 52
Discrete & Computational Geometry : Volume 51
Discrete & Computational Geometry : Volume 50
Discrete & Computational Geometry : Volume 49
Discrete & Computational Geometry : Volume 48
Discrete & Computational Geometry : Volume 47
Discrete & Computational Geometry : Volume 46
Discrete & Computational Geometry : Volume 45
Discrete & Computational Geometry : Volume 44
Discrete & Computational Geometry : Volume 43
Discrete & Computational Geometry : Volume 42
Discrete & Computational Geometry : Volume 41
Discrete & Computational Geometry : Volume 40
Discrete & Computational Geometry : Volume 39
Discrete & Computational Geometry : Volume 38
Discrete & Computational Geometry : Volume 37
Discrete & Computational Geometry : Volume 36
Discrete & Computational Geometry : Volume 35
Discrete & Computational Geometry : Volume 34
Discrete & Computational Geometry : Volume 33
Discrete & Computational Geometry : Volume 32
Discrete & Computational Geometry : Volume 31
Discrete & Computational Geometry : Volume 30
Discrete & Computational Geometry : Volume 29
Discrete & Computational Geometry : Volume 28
Discrete & Computational Geometry : Volume 27
Discrete & Computational Geometry : Volume 26
Discrete & Computational Geometry : Volume 25
Discrete & Computational Geometry : Volume 24
Discrete & Computational Geometry : Volume 23
Discrete & Computational Geometry : Volume 22
Discrete & Computational Geometry : Volume 21
Discrete & Computational Geometry : Volume 20
Discrete & Computational Geometry : Volume 19
Discrete & Computational Geometry : Volume 18
Discrete & Computational Geometry : Volume 17

Similar Documents

...
Extremal Convex Planar Sets

Article

...
About 4-Isosceles Planar Sets

Article

...
Open Caps and Cups in Planar Point Sets

Article

...
Vietoris–Rips Complexes of Planar Point Sets

Article

...
Staircase Connected Sets

Article

...
Point Sets with Many k-Sets

Article

...
Valuations on Convex Sets of Oriented Hyperplanes

Article

...
Simple Paradoxical Replications of Sets

Article

...
Covering Paths for Planar Point Sets

Article

On the Odd Area of Planar Sets

Content Provider Springer Nature Link
Author Oren, Assaf Pak, Igor Pinchasi, Rom
Copyright Year 2016
Abstract The main result in the paper is a construction of a simple (in fact, just a union of two squares) set T in the plane with the following property. For every $$\varepsilon >0$$ there is a family $$\mathcal{F}$$ of an odd number of translates of T such that the area of those points in the plane that belong to an odd number of sets in $$\mathcal{F}$$ is smaller than $$\varepsilon $$ .
Starting Page 715
Ending Page 724
Page Count 10
File Format PDF
ISSN 01795376
Journal Discrete & Computational Geometry
Volume Number 55
Issue Number 3
e-ISSN 14320444
Language English
Publisher Springer US
Publisher Date 2016-03-07
Publisher Place New York
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Combinatorics Computational Mathematics and Numerical Analysis
Content Type Text
Resource Type Article
Subject Discrete Mathematics and Combinatorics Theoretical Computer Science Computational Theory and Mathematics Geometry and Topology
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
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
I will try my best to help you...
Cite this Content
Loading...