Sphere packing and medical applications

Danny Z. Chen; Jinhui Xu

doi:10.1201/9781420010749

Sphere packing and medical applications

Danny Z. Chen
, Jinhui Xu

Department of Computer Science and Engineering

University of Notre Dame

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

In this chapter, we consider the following sphere packing problem: Given a polygonal (or polyhedral) region R (called the container or domain) in two (or higher-dimensional space and an infinite object set O of “solid” unit spheres, find a sphere packing SP for R using the spheres in O such that (i) each sphere in SP is inside R, (ii) no two spheres in SP intersect each other in their interior, and (iii) the volume of R covered by SP (called the density) is maximized.

Original language	English
Title of host publication	Handbook of Approximation Algorithms and Metaheuristics
Publisher	CRC Press
Pages	78-1-78-14
ISBN (Electronic)	9781420010749
ISBN (Print)	1584885505, 9781584885504
DOIs	https://doi.org/10.1201/9781420010749
State	Published - Jan 1 2007

Access to Document

10.1201/9781420010749

Cite this

@inbook{1509d837123a4509a68c0578af4c044d,

title = "Sphere packing and medical applications",

abstract = "In this chapter, we consider the following sphere packing problem: Given a polygonal (or polyhedral) region R (called the container or domain) in two (or higher-dimensional space and an infinite object set O of “solid” unit spheres, find a sphere packing SP for R using the spheres in O such that (i) each sphere in SP is inside R, (ii) no two spheres in SP intersect each other in their interior, and (iii) the volume of R covered by SP (called the density) is maximized.",

author = "Chen, \{Danny Z.\} and Jinhui Xu",

note = "Publisher Copyright: {\textcopyright} 2007 by Taylor \& Francis Group, LLC.",

year = "2007",

month = jan,

day = "1",

doi = "10.1201/9781420010749",

language = "English",

isbn = "1584885505",

pages = "78--1--78--14",

booktitle = "Handbook of Approximation Algorithms and Metaheuristics",

publisher = "CRC Press",

address = "Netherlands",

}

TY - CHAP

T1 - Sphere packing and medical applications

AU - Chen, Danny Z.

AU - Xu, Jinhui

PY - 2007/1/1

Y1 - 2007/1/1

N2 - In this chapter, we consider the following sphere packing problem: Given a polygonal (or polyhedral) region R (called the container or domain) in two (or higher-dimensional space and an infinite object set O of “solid” unit spheres, find a sphere packing SP for R using the spheres in O such that (i) each sphere in SP is inside R, (ii) no two spheres in SP intersect each other in their interior, and (iii) the volume of R covered by SP (called the density) is maximized.

AB - In this chapter, we consider the following sphere packing problem: Given a polygonal (or polyhedral) region R (called the container or domain) in two (or higher-dimensional space and an infinite object set O of “solid” unit spheres, find a sphere packing SP for R using the spheres in O such that (i) each sphere in SP is inside R, (ii) no two spheres in SP intersect each other in their interior, and (iii) the volume of R covered by SP (called the density) is maximized.

UR - https://www.scopus.com/pages/publications/85056057732

U2 - 10.1201/9781420010749

DO - 10.1201/9781420010749

M3 - Chapter

AN - SCOPUS:85056057732

SN - 1584885505

SN - 9781584885504

SP - 78-1-78-14

BT - Handbook of Approximation Algorithms and Metaheuristics

PB - CRC Press

ER -

Sphere packing and medical applications

Abstract

Access to Document

Other files and links

Fingerprint

Cite this