Parallel Point Set Rotation for Minimum-Area Bounding Shapes

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional systems for determining minimum-area bounding rectangles are inefficient due to the need to compute convex hulls and iterate over edges, which increases latency and is difficult to implement programmatically, especially when processing multiple objects sequentially.

Innovation Solution

The system determines bounding shapes by rotating points to various orientations without initially computing a convex hull, allowing for parallel processing and reducing the number of algorithms required, thereby decreasing latency and improving efficiency for multiple objects.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If conventional systems compute convex hull and iterate over edges to determine minimum-area bounding rectangle, then the bounding rectangle can be accurately determined, but the processing latency increases and implementation complexity increases

Engineering Contradiction:
Improvebounding rectangle accuracyVSAvoidprocessing latency
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent rotates the point set to various orientations in advance before computing bounding rectangles, allowing parallel processing of multiple orientations simultaneously. This preliminary rotation action eliminates the need for sequential edge iteration over convex hull, reducing processing latency while maintaining accurate minimum-area bounding rectangle determination.

Inventive Principle:
Principle #10Preliminary action

2Measurement precision

If conventional systems use multiple algorithms (Sklansky for convex hull, Rotating Calipers for bounding rectangle), then the bounding rectangle can be determined, but the implementation difficulty increases

Engineering Contradiction:
Improvebounding rectangle determinationVSAvoidimplementation difficulty
Core Design Contradiction:
Measurement precisionVSEase of manufacture

Solution Approach 1:

The patent merges the convex hull computation and bounding rectangle determination into a single unified process. By rotating the original point set and computing bounding rectangles directly from rotated points, the system eliminates the need for separate Sklansky and Rotating Calipers algorithms, simplifying implementation while maintaining determination accuracy.

Inventive Principle:
Principle #5Merging (Combining)

3Measurement precision

If conventional systems process objects sequentially, then each object can be processed accurately, but the overall processing speed decreases

Engineering Contradiction:
Improveobject processing accuracyVSAvoidprocessing speed
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent segments the processing task by independently rotating and processing each object's point set to various orientations. This segmentation enables parallel processing of multiple objects simultaneously, as each object can be rotated and have bounding rectangles computed independently without waiting for sequential processing of other objects, thereby increasing overall processing speed while maintaining accuracy.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS20240395005A1Computing minimum area bounding shapes using parallel point set rotations in image processing systems and applications
Publication Date: 2024.11.28 NVIDIA CORP
  • US20240395005A1 patent drawing
  • US20240395005A1 patent drawing
  • US20240395005A1 patent drawing

AI summary

In various examples, determining point bounding shapes for systems and applications is described herein. Systems and methods are disclosed that determine a bounding shape (e.g., a minimum-area bounding rectangle) for an object and/or a point set associated with the object. In some examples, to determine the bounding shape, the systems and methods may rotate points from the point set to include various orientations. The systems and methods may then determine a respective bounding shape for one or more (e.g., each) orientation of the points and use the bounding shapes to determine a final bounding shape for the points. For example, the bounding shape that is associated with the smallest area may be selected for the points. The bounding shape may then be rotated by an angle in order to determine a final bounding shape for the object.