upper lower Figure 1: Left hand side: The points belonging to the convex hull...  Home/Search
Context
Related
| informatik.unitrier.de./~ke...qhull.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unitrier.de./~ke...ag (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: > (right) of the line. In particular, for S upper we have S = S upper [ fu; vg with p 1 = u and p 2 = v; for S lower we set S = S lower [ fv; ug with p 1 = v and p 2 = u. Now we apply the following recursive method to S and (p 1 ; p 2 ): We determine the point pivot 2 S (called the pivot point) with the largest distance from line (p 1 ; p 2 ) (see Figure 2, left hand side), i.e. which maximizes the cross product #define cross(pivot,p1,p2) " ((x[p1]-x[pivot])*(y[p2]-y[pivot]) -... (Update)
Similar documents (at the sentence level):
63.6%: Practical Pram Programming with Fork95: A Tutorial - Keßler (Correct)
Similar documents based on text: More All
0.3: A Faster Implementation of the Pivot Algorithm for Self-Avoiding.. - Kennedy (2001) (Correct)
0.2: A New Ultimate Convex Hull Algorithm in R² - Rösler, Steiger, Kravitz (2000) (Correct)
0.2: Randomized Quick Hull - Wenger (1995) (Correct)
BibTeX entry: (Update)
@misc{ applications-quickhull,
author = "Fork Typical Applications",
title = "The QuickHull algorithm in",
url = "citeseer.ist.psu.edu/334550.html" }
Citations not processed or no citations identified.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC