Name
Abstract | ||
|---|---|---|
We present an incremental convex hull computing algorithm for planar straight line intersections. Updating is done by finding the enclosing lines of the input line and their pairwise intersection points. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1016/0167-8655(90)90023-U | Pattern Recognition Letters |
Keywords | Field | DocType |
planar line intersection,convex hull,avl tree,incremental computation,line intersections | Line (geometry),Convex combination,Computational geometry,Convex hull,Convex set,Artificial intelligence,Computation,Orthogonal convex hull,Computer vision,Combinatorics,Algorithm,Planar,Mathematics | Journal |
Volume | Issue | ISSN |
11 | 8 | Pattern Recognition Letters |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Boreddy | 1 | 3 | 1.19 |