An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves (Q2868910): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57659433, #quickstatements; #temporary_batch_1705549208013
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331934.2011.623163 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006943183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of orienting curves for determining the convex hull of a finite set of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The implementation of an algorithm to find the convex hull of a set of three-dimensional points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the upper-bound conjecture for convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Geometry in C / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Lösung eines zermelosehen nayigationsproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of orienting curves for solving optimal control problems with state constraints<sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of orienting curves and its application to manipulator trajectory planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust gift wrapping for the three-dimensional convex hull / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:58, 7 July 2024

scientific article
Language Label Description Also known as
English
An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves
scientific article

    Statements

    An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves (English)
    0 references
    0 references
    0 references
    0 references
    19 December 2013
    0 references
    geometric computing
    0 references
    convex hull algorithms
    0 references
    gift-wrapping algorithm
    0 references
    method of orienting curves
    0 references

    Identifiers