department

Free access

Puzzled
Covering the plane

Author:

Peter WinklerAuthors Info & Claims

Communications of the ACM, Volume 52, Issue 11

Page 112

https://doi.org/10.1145/1592761.1592786

Published: 01 November 2009 Publication History

All formats PDF

Abstract

Welcome to three new puzzles. Solutions to the first two will be published next month; the third is (as yet) unsolved. In each, the issue is how your intuition matches up with the mathematics.

Cited By

View all

Pach JPálvölgyi D(2016)Unsplittable coverings in the planeAdvances in Mathematics10.1016/j.aim.2016.07.011302(433-457)Online publication date: Oct-2016
https://doi.org/10.1016/j.aim.2016.07.011
Pach JPálvölgyi D(2015)Unsplittable Coverings in the PlaneRevised Papers of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science - Volume 922410.1007/978-3-662-53174-7_20(281-296)Online publication date: 17-Jun-2015
https://dl.acm.org/doi/10.1007/978-3-662-53174-7_20
Ferreira JMendes ACunha ABaquero CSilva PBarbosa LOliveira J(2011)Logic training through algorithmic problem solvingProceedings of the Third international congress conference on Tools for teaching logic10.5555/2021573.2021581(62-69)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.5555/2021573.2021581

Index Terms

Puzzled

Covering the plane
1. Mathematics of computing

Recommendations

Puzzled: Solutions and sources

Last month (Nov. 2011, p. 120) we posted a trio of brainteasers, including one as yet famously unsolved, concerning distances between points on the plane. Here, we offer solutions to two of them. How did you do?
Unavoidable Crossings in a Thinnest Plane Covering with Congruent Convex Disks

Two convex disks K and L in the plane are said to cross each other if the removal of their intersection causes each disk to fall into disjoint components. Almost all major theorems concerning the covering density of a convex disk were proved only for ...
Puzzled: Solutions and sources

It's amazing how little we know about the simple, ordinary, axis-aligned rectangle. Last month (p. 112) we posted a trio of brainteasers, including one as yet unsolved, concerning rectangles galore. Here, we offer solutions to at least two of them. How ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 52, Issue 11

Scratch Programming for All

November 2009

135 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/1592761

Issue’s Table of Contents

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 November 2009

Published in CACM Volume 52, Issue 11

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Department
Popular
Un-reviewed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
740
Total Downloads

Downloads (Last 12 months)151
Downloads (Last 6 weeks)20

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Pach JPálvölgyi D(2016)Unsplittable coverings in the planeAdvances in Mathematics10.1016/j.aim.2016.07.011302(433-457)Online publication date: Oct-2016
https://doi.org/10.1016/j.aim.2016.07.011
Pach JPálvölgyi D(2015)Unsplittable Coverings in the PlaneRevised Papers of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science - Volume 922410.1007/978-3-662-53174-7_20(281-296)Online publication date: 17-Jun-2015
https://dl.acm.org/doi/10.1007/978-3-662-53174-7_20
Ferreira JMendes ACunha ABaquero CSilva PBarbosa LOliveira J(2011)Logic training through algorithmic problem solvingProceedings of the Third international congress conference on Tools for teaching logic10.5555/2021573.2021581(62-69)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.5555/2021573.2021581

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

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

Abstract

Cited By

Index Terms

Recommendations

Puzzled: Solutions and sources

Unavoidable Crossings in a Thinnest Plane Covering with Congruent Convex Disks

Puzzled: Solutions and sources

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Digital Edition

Magazine Site

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations