An incremental computation of convex hull of planar line intersections

dc.contributor.author	Boreddy J.
dc.date.accessioned	2025-05-24T09:56:54Z
dc.description.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. © 1990.
dc.identifier.doi	https://doi.org/10.1016/0167-8655(90)90023-U
dc.identifier.uri	http://172.23.0.11:4000/handle/123456789/21538
dc.relation.ispartofseries	Pattern Recognition Letters
dc.title	An incremental computation of convex hull of planar line intersections

Collections