Covering a plane with ellipses

DOI10.1080/02331934.2013.830119MaRDI QIDQ5746678zbMATH OpenOpenAlexFDO

Authors A. I. Erzin, S. N. Astrakov

Publication date 7 February 2014

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2013.830119

zbMATH Keywords

coverage densityplane coveringwireless sensor networks

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Numerical optimization and variational techniques (65K10) Combinatorial optimization (90C27)

Recommendations

• Sensor networks and covering of plane by discs
• Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses
• Covering a planar region by randomly distributed sensors
• On the density of a strip cover with identical sectors
• Covering the plane with fat ellipses without non-crossing assumption

Cites work

• Covering the plane with two kinds of circles
• ENERGY-EFFICIENT NODE SCHEDULING MODELS IN SENSOR NETWORKS WITH ADJUSTABLE RANGES
• scientific article; zbMATH DE number 3282420 (Why is no real title available?)
• scientific article; zbMATH DE number 3083197 (Why is no real title available?)
• The Number of Circles Covering a Set

Cited in

(6)

• Almost-tiling the plane by ellipses
• Covering with ellipses
• Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses
• Sensor networks and covering of plane by discs
• On the density of a strip cover with identical sectors
• Energy-efficient regular strip covering with fixed-size identical sectors

This page was built for publication: Covering a plane with ellipses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746678)