Triangulation of random and scattered data
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Jun 27, 1995
Grant Date -
N/A
app pub date -
Aug 28, 1992
filing date -
Aug 28, 1992
priority date (Note) -
Expired
status (Latency Note)
Importance
Abstract
A rapid and efficient method for triangulating random points is based on a 'circular' triangulation strategy that allows the deletion of data points from the data set during triangulation. In one embodiment, data is initially preprocessed by sorting and is put into a sparse matrix, while in another embodiment, data is preprocessed directly into a uniform grid prior to the triangulation strategy. A circular queue is used to govern the triangulation process and allows dynamic update of the internal matrix or grid data structure. A substantial decrease in complexity is provided by the triangulation strategy as the number of points to be searched for triangle points decreases as the triangles are created. The method is stable and fast and is not sensitive to difficult cases such as collinear or nearly collinear points.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully