
	Where results make sense

Topic: Graham scan

Related Topics

Point in polygon

List of algorithms

Snapshot algorithm

Ray tracing

	Graham Kerr
		Graham Kerr is an internationally known culinary and television personality, award-winning author, and master of metaphorical speaking.
		Graham has established an ongoing partnership with the American Dietetic Association in order for the ADA to serve as nutrition advisor for his programs and book recipes.
		Treena Kerr, Graham Kerr's wife, has served as co-creator for all television activities since 1969, when she was twice nominated for the Emmy's "Daytime TV Producer of the Year." Treena is also a published poet and has published a new book, “Substance In Shadow” that is also available in a musically scored CD.
	www.grahamkerr.com /gk.php (1379 words)

	NationMaster - Encyclopedia: Graham scan (Site not responding. Last check: )
		The Graham scan, named after Ronald Graham, is a method of computing the convex hull of a given set of points in the plane with time complexity O(n log n).
		Ronald L. Graham (born October 31, 1935) is a mathematician credited by the American Mathematical Society with being one of the principle architects of the rapid development worldwide of discrete mathematics in recent years[1].
		Ronald Lewis Graham (born October 31, 1935) is a mathematician credited by the American Mathematical Society with being "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years"[1].
	www.nationmaster.com /encyclopedia/Graham-scan (1170 words)

	Graham's scan@Everything2.com
		Graham's scan is an algorithm used to find the boundary on a set of points that form a convex hull.
		Invented in the early 70's by a person called Ron Graham, it is one of the earliest algorithms used in the field of computational geometry.
		Published by Ron Graham in 1972, Graham's scan is an optimal algorithm for finding the convex hull of a set of points.
	everything2.com /index.pl?node_id=1417755 (1291 words)

	[No title]
		When we caught up with GM’s Larry Graham, global manager, manufacturing technologies, global produce product, information systems, and services, he was more than happy to share his thoughts on emerging AIDC technologies and GM’s ongoing traceability and labeling initiatives.
		This is a tremendous accomplishment.” Graham will host the automotive forum at Frontline’s International Supply Chain Week in Chicago, which runs from September 15-18.
		Graham said the company has taken an active role in working with INCITS (the International Committee for Information Technology Standards).
	www.scandcr.com /fileadmin/GM/GM_Paves_Highway_For_AIDC_Adoption.doc (953 words)

	Graham's Scan
		The problem with Graham’s algorithm is that it has no obvious extension to three dimensions.
		The reason is that the Graham’s scan depends on angular sorting, which has no direct counterpart in three dimensions.
		This point will be the pivot, is guaranteed to be on the hull, and is chosen to be the point with smallest y coordinate.
	www.personal.kent.edu /~rmuhamma/Compgeometry/MyCG/ConvexHull/GrahamScan/grahamScan.htm (622 words)

	Convex Hull
		The primary convex hull algorithm in the plane is the Graham scan.
		Graham scan starts with one point p known to be on the convex hull (say the point with lowest x-coordinate) and sorts the rest of the points in angular order around p.
		The basic Graham scan procedure can also be used to construct a nonself-intersecting (or simple) polygon passing through all the points.
	www2.toki.or.id /book/AlgDesignManual/BOOK/BOOK4/NODE185.HTM (1597 words)

	On-site 9840 Scanning - Graham Magnetics
		Graham offers you two comprehensive on-site programs for 9840s in order to ensure the safety of your data.
		With our on-site scanning program, we scan the tapes at your facility with our proprietary tracking system, ship the tapes to our Graham plant via secure carrier and you are able to view the progress of the tapes every step of the way.
		Once received in Graham, tapes are again scanned and compared to the original list to assure all tapes are accounted for.
	www.grahammagnetics.com /onsite-scanning.html (360 words)

	ArticleS.UncleBob.ConvexHullTiming (Site not responding. Last check: )
		In such case, Graham Scan will be more stable and have a lower averagely time complexity on total.
		Indeed, since the average number of hull point is also 38 (a very interesting coincidence) the statistical average performance of the Jarvis march is roughly the same as the graham scan.
		Graham Scan and Jarvis March should be used in different situation.
	www.butunclebob.com /ArticleS.UncleBob.ConvexHullTiming (993 words)

	3 Coins Algorithm for Convex Hulls of Polygons
		The Sklanksy Scan does not take into consideration the fact that a ploygon with only right turns may not be simple.
		Although the Sklansky Scan does not work for all simple polygons, there are several important, frequently encountered classes of polygons for which it does work, such as monotone, star-shaped and maximal polygons.
		Graham's first step was not to find an extremal point, but to find a point within the hull.
	cgm.cs.mcgill.ca /~beezer/cs507/main.html (2157 words)

	Exam 2, CSCI 3650, Summer 2000 (Site not responding. Last check: )
		Consider that Graham scan algorithm for computing the convex hull of a collection of points in the plane.
		Show that the cost of the scan phase of Graham's algorithm is linear by noting that the potential cannot be lower at the end of the algorithm than it is at the start of the algorithm, and that the amortized cost per operation is constant.
		A suggestion is to use a modification of the Graham scan algorithm.
	www.cs.ecu.edu /~karl/3650/sum00/exam2.html (831 words)

	[No title] (Site not responding. Last check: )
		The inefficient method you are might be referring to is often called a "shrink-wrap" and requires a number of comparisons that is proportional to the square of the number (n) of points.
		The Graham Scan is an order n*log2(n) which is considerably more efficient than n^2.
		My code is somewhat like Graham scan, but uses two sorts by x-coordinate instead of one sort by angle, and explicitly computes the "upper hull" and the "lower hull" of the points.
	www.math.niu.edu /~rusin/known-math/96/convhul (436 words)

	Laser-Scan Strengthens Senior Management Team
		Graham has over 20 years experience in the geospatial industry.
		At ESRI Graham was involved in particular in the data model extensions for Dynamic Segmentation and regions and worked on the integration of spatial data with Management Information Systems.
		Graham then joined Unisys as Business Development Manager for EMEA where he again was involved in the integration of spatial data into enterprise-wide systems.
	www.agi.org.uk /pooled/articles/BF_NEWSART/view.asp?Q=BF_NEWSART_209763 (491 words)

	Robert Graham
		The process involved was lengthy and impressive, especially the use of new digital mapping and prototyping techniques which allowed Graham to scan and reproduce his original works as bronze castings.
		So, Graham's particular usage over the years of a figurative woman's digitally morphed body type found an apt formulation as a statue of Mary that needed to be both a specific individual semblance and an image that would work within the realm of an overarching symbol.
		Graham as a rule willfully excludes sentiment and sentience, which acts as a blanketing force over the sexually charged, nubile bodies.
	artscenecal.com /ArticlesFile/Archive/Articles2003/Articles1203/RGrahamB.html (896 words)

	Value Investing Benjamin Graham style - Boost your Roth IRA or Retirement Savings Account By Being an Intelligent ...
		Graham, (1894-1976) contributed enormously to the subjects of Value Investing and Security Analysis.
		We use a computerized scan to quickly sift through the fundamentals of thousands of stocks to find those which are in some way undervalued or ignored by Wall Street and the investing public for no good reason in spite of stellar results year after year.
		One of Graham's best-known disciples, Warren Buffett, certainly could be said to have followed the above advice to the letter.
	www.grahaminvestor.com (732 words)

	Graham Lecture,MAA,PNW,Mathematical Association of America,Pacific Northwest Section (Site not responding. Last check: )
		Ron Graham has been one of the principal architects of the rapid development worldwide of discrete mathematics in recent years.
		Graham has received the Plya Prize in Combinatorics from the Society for Industrial and Applied Mathematics, the Euler Medal from the Institute of Combinatorics and Its Applications, the Lester R. Ford Award from the Mathematical Association of America (MAA), and the Carl Allendoerfer Award from the MAA.
		He was an invited speaker at the International Congress of Mathematicians in Warsaw in 1983 and was the AMS Gibbs Lecturer in 2000.
	www.math.ubc.ca /~cayf/grahamlecture.html (318 words)

	Convex Hull of a 2D Point Set or Polygon
		The most popular algorithms are the "Graham scan" algorithm [Graham, 1972] and the "divide-and-conquer" algorithm [Preparata and Hong, 1977].
		The Graham scan algorithm [Graham, 1972] is often cited ([Preparata and Shamos, 1985], [O'Rourke, 1998]) as the first "computational geometry" algorithm.
		The lower or upper convex chain is constructed using a stack algorithm almost identical to the one used for the Graham scan.
	geometryalgorithms.com /Archive/algorithm_0109/algorithm_0109.htm (2504 words)

	www.Graham-Infotech.com (Site not responding. Last check: )
		Graham offers a range of hi-performance scanners at different price points to suit individual requirements.
		Graham will not be responsible for typographical or other errors or omissions regarding prices or other information.
		All sales are subject to Graham's Term and Conditions of Sale.
	www.graham-infotech.com /scanners.asp (118 words)

	Dr. Dobb's \| Algorithm Alley \| July 22, 2001 (Site not responding. Last check: )
		For this reason Graham's Scan may be the better choice for a general-purpose convex hull algorithm.
		Graham's Scan begins by locating the lowest point; call it the pivot point.
		To illustrate the Graham's Scan algorithm, consider the set of points in Figure 3.
	www.ddj.com /184404620 (2602 words)

	UCSD Department of Computer Science and Engineering - CSE Professor Ron Graham Wins Prestigious Mathematics Prize
		UCSD professor Ronald Graham has received the 2003 Steele Prize for Lifetime Achievement.
		Graham, the Irwin and Joan Jacobs Professor in CSE, accepted the prize at the Joint Mathematics Meetings in Baltimore, Maryland.
		Graham was awarded a Ph.D. in Mathematics from the University of California, Berkeley, in 1962.
	www.cs.ucsd.edu /aboutcse/newstories/20030116-graham.html (338 words)

	[No title]
		An O(n log n) algorithm for computing convex hulls was one of the earliest results in computational geometry (due to Ron Graham).
		Graham's scan: We will present an O(n log n) algorithm for convex hulls.
		It is a simple variation of a famous algorithm for convex hulls, called Graham's scan.
	www.cs.wustl.edu /~pless/506/l2.html (1841 words)

	Silicon Fen Business Report \| Silicon Fen
		He began his career as a Research Hydrologist and went on to work in the UK Water Industry as a consultant in Digital Mapping and GIS and then joined ESRI in the late 1980s.
		Afer that Graham joined Unisys as Business Development Manager for EMEA where he was involved in the integration of spatial data into enterprise-wide systems.
		In 1995 Graham joined Exor Corporation where he was initially responsible for their Spatial Strategy and Business Development.
	www.siliconfenbusiness.com /thisweek.php?id=294 (149 words)

	The Graham Scan Triangulates Simple Polygons - Kong, Everett, Toussaint (ResearchIndex)
		Abstract: The Graham scan is a fundamental backtracking technique in computational geometry which was originally designed to compute the convex hull of a set of points in the plane and has since found application in several different contexts.
		In this note we show how to use the Graham scan to triangulate a simple polygon.
		The resulting algorithm triangulates an n vertex polygon P in O(kn) time where k-1 is the number of concave vertices in P. Although the worst case running time of the algorithm is O(n...
	citeseer.ist.psu.edu /kong91graham.html (598 words)

	Graham Construction
		Graham Construction has over four million square feet of experience in healthcare construction.
		Graham Construction’s method of project management was created to watchdog the complex details of medical construction — details that have critical consequences.
		Click on the links to the left to see what some of our customers have said about their experiences working with Graham Construction and see the list below showing our extensive experience in medical construction.
	www.grahamconstruction.com /exp-med.html (447 words)

	Convex Hull: Graham's scan
		Given a set of points on the plane, Graham's scan computes their convex hull.
		This point will be the pivot, is guaranteed to be on the hull, and is chosen to be the point with largest y coordinate.
		You need a java-enabled browser to run this applet.
	www.cs.princeton.edu /~ah/alg_anim/version1/GrahamScan.html (164 words)

	Convex Hull of a 2D Point Set or Polygon
		The most popular algorithms are the "Graham scan" algorithm [Graham, 1972] and the "divide-and-conquer" algorithm [Preparata and Hong, 1977].
		The Graham scan algorithm [Graham, 1972] is often cited ([Preparata and Shamos, 1985], [O'Rourke, 1998]) as the first "computational geometry" algorithm.
		The lower or upper convex chain is constructed using a stack algorithm almost identical to the one used for the Graham scan.
	softsurfer.com /Archive/algorithm_0109/algorithm_0109.htm (2504 words)

	ASPN : Python Cookbook : Convex hull and diameter of 2d point sets (Site not responding. Last check: )
		Returns the convex hull (separated into upper and lower chains of vertices) and the diameter (farthest pair of points), given input consisting of a list of 2d points represented as pairs (x,y).
		The convex hull algorithm is Graham's scan, using a coordinate-based sorted order rather than the more commonly seen radial sorted order.
		The lexicographic sort and generation of upper and lower portions of the hull are features of Andrew's algorithm that are not present in Graham's.
	aspn.activestate.com /ASPN/Cookbook/Python/Recipe/117225 (388 words)

	PCIN Issue 440 - SueTube?
		PCIN is brought to you by Graham Wing.
		The opinions expressed are those of the Editor, Graham Wing and the Assistant Editor, Chris Empey.
		Graham Wing and Chris Empey accept no responsibility for the results obtained from trying the tips in this newsletter.
	www.pcin.net /archive/latest.php (961 words)

	CSCI 3104 Class notes Page 25 (Site not responding. Last check: )
		Graham's scan amounts to dragging a rope tape clockwise through the points, pulling it taut to get out the concave kinks.
		As a function of the number n of points its running time is O(n^2), worse than Graham's scan.
		But in terms of the number h of points that form the hull it is O(h*n), which can be better than O(n log n).
	www.cs.colorado.edu /~karl/3104.fall95/25.html (198 words)

	AA Scan, Inc. -
		That was a clear signal that something had to be done while there was still a usable original to work with." So the office hired AA Scan, an engineering services firm based in Akron, Ohio, to scan the drawings into raster format.
		Now that the maps are in electronic format, they no longer are susceptible to deterioration or aging.
		Through a special arrangement between the office and AA Scan, copies of the scanned maps, along with a special TIFF-only version of Myriad, are available for purchase on CD ROM.
	www.aascan.com /starkca.htm (449 words)

	FAQ - grahamwatson.safeshopper.com
		It depends on where the slide is. As you can imagine, Graham's images are sent to publications all around the world and some times locating a particular image is not a simple task.
		We would be glad to ship products abroad, however, be aware that International shipping costs are high and that you will be responsible for any duties that might apply.
		All images sold through this web site are for personal display use only and no commercial or reproduction rights are granted unless specified in writing by Graham Watson.
	grahamwatson.safeshopper.com /faq.htm?859 (383 words)

	RIOT -- The Convex Hull Problem: Detailed Description (Site not responding. Last check: )
		To calculate the convex hull we use Graham's scan algorithm [G72]:
		Find a point, P, interior to the convex hull by taking the average of the coordinates of all the given points.
		[G72] R.L. Graham, An efficient algorithm for determining the convex hull of a finite
	riot.ieor.berkeley.edu /riot/Applications/ConvexHull/CHDetails.html (251 words)

Try your search on: Qwika (all wikis)