A Review of the Packing Problem.

Abstract

This random packing problem has been of interest to investigators in several disciplines. Physical chemists have investigated such models in two and three dimensions. Because of analytical difficulties, one-dimensional analogues have been explored and these are referred to as the parking problem. A number of results are explored and attempts are made to tie them together. Applications are also highlighted. Keywords: Random packing, parking problem, Palasti conjecture.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 12, 1986
Accession Number
ADA175007

Entities

People

  • Herbert Solomon
  • Howard Weiner

Organizations

  • Stanford University

Tags

Communities of Interest

  • Air Platforms
  • Cyber
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Analogs
  • Artificial Intelligence
  • Computational Science
  • Equations
  • Geometry
  • Monte Carlo Method
  • New York
  • Packing Density
  • Physics
  • Probability
  • Probability Distributions
  • Random Variables
  • Sequences
  • Statistics
  • Three Dimensional
  • Two Dimensional
  • United States

Fields of Study

  • Education

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design