A Circle Packing Problem and Its Connection to Malfatti’s Problem

D. Munkhdalai and R. Enkhbat
Additional contact information
D. Munkhdalai: National University of Mongolia
R. Enkhbat: National University of Mongolia

A chapter in Open Problems in Optimization and Data Analysis, 2018, pp 225-248 from Springer

Abstract: Abstract We have analytically solved the problem how to split a given triangle’s two sides by a line such that a total area of inscribed two circles embedded in each side of the line reaches the maximum. We also show that Malfatti’s problem for n = 2 is a particular case of our problem.

Keywords: Geometry; Circle packing; Malfatti’s problem (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-99142-9_12

Ordering information: This item can be ordered from
http://www.springer.com/9783319991429

DOI: 10.1007/978-3-319-99142-9_12

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().