ScholarLens Back to search
2017•Lecture notes in computer scienceRequires access

Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density

Sándor P. Fekete, Sebastian Morr, Christian Scheffer

Open publisher page 6 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Circle packing, Packing problems, Sphere packing, Subdivision, Combinatorics, Square (algebra), Set (abstract data type), Set packing

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density — Research Paper | ScholarLens