We discuss several ways of packing a hyperbolic surface with circles (of either varying radii or all being congruent) or horocycles, and note down some observations related to their symmetries (or the absence thereof).

In this research a multi-sensor and data fusion approach was developed to create variable depth tillage zones. Data collected with an electromagnetic sensor was fused with measurements taken with a hydraulic penetrometer and conventionally acquired soil bulk density (BD) and moisture content (MC) measurements. Packing density values were then calculated for eight soil layers to determine the need to cultivate or not. From the results 62% of the site required the deepest tillage at 38 cm, 16% required tillage at 33 cm and 22% required no tillage at all. The resultant maps of packing density were shown to be a useful approach to map layered soil compaction and guide VDT operations.

One-dimensional random packing, known as the car-parking problem, was first analyzed by Rényi (1958). A stochastic version of Kakutani's (1975) interval splitting is another typical model on a one-dimensional interval. We consider a generalized car-parking problem which contains the above two models as special cases. In the generalized model, one can park a car of length l, if there is a space not less than 1. We give the limiting packing density and the limiting distribution of the length of randomly selected gaps between cars. Our results bridge the two models of Rényi and Kakutani.