Minimum bounding box algorithms
Semantic Scholar uses AI to extract papers important to this topic.
Conway’s Game of Life has inspired enthusiasts to search for a wide range of patterns for this classic cellular automaton. One… (More)
Object attribute Description FID The ID number of the object Area_Pxl Area of the object measured in cells (1 cell is appr. 1 km… (More)
K-neighbor search algorithm is an important class of query type in the spatial database, a new K-neighbor search algorithm based… (More)
In many tracking applications, the extent of the target object is neglected and it is assumed that the received measurements stem… (More)
- Document Analysis Systems
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that… (More)
- Microprocessors and Microsystems
Geometric algorithms play an important role in computer graphics and digital image analysis. This paper makes an improvement of… (More)
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set… (More)
This paper presents BSR-parallel algorithms for three geometrical problems : point location, convex hull and smallest enclosing… (More)
- IEEE Trans. Parallel Distrib. Syst.
The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be… (More)
The first and the most critical stage in VLSI layout design is the placement, the background of which is the rectangle packing… (More)