"An O(n log n) algorithm for computing a link center in a simple polygon"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Computing the link center of a simple polygon.	W. Lenhart	1987	Courant Institute of Mathematical Sciences, New York University
Computing the geodesic center of a simple polygon	Richard Pollack	1986	Courant Institute of Mathematical Sciences, New York University
Computing external-farthest neighbors for a simple polygon	Pankaj K. Agarwal	1989	Courant Institute of Mathematical Sciences, New York University
An O(n log n) algorithm for the maximal planar subgraph problem.	Jiazhen Cai	1992	Courant Institute of Mathematical Sciences, New York University
An O(n log n) algorithm for the maximal planar subgraph problem	Jiazhen Cai	1992	Courant Institute of Mathematical Sciences, New York University
An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments (preliminary version).	Chee K. Yap	1985	Courant Institute of Mathematical Sciences, New York University
On the geodesic Voronoi diagram of point sites in a simple polygon.	Boris Aronov	1988	Courant Institute of Mathematical Sciences, New York University
An algorithm for computing options on the maximum or minimum of several assets	Phelim P. Boyle	1989	College of Commerce and Business Administration, University of Illinois Urbana-Champaign
An algorithm for computing the alphawidth of (0, 1) matrices	Walter Lane Stanley	1965	Naval Postgraduate School
An investigation of selection methods for a simple program flow analysis algorithm	Norbert Lukasczyk	1974	Naval Postgraduate School
A polynomial-time algorithm for computing the yolk in fixed dimension	Craig A. Tovey	1991	Naval Postgraduate School;Available from National Technical Information Service
Once Upon an Algorithm: How Stories Explain Computing	Martin Erwig	2017	MIT Press
Once upon an algorithm: how stories explain computing	Martin Erwig	2017	MIT Press
Once Upon an Algorithm: How Stories Explain Computing	Martin Erwig	2017	MIT Press,
Investigation and implementation of an algorithm for computing optimal search paths	James F. Caldwell	1987
An algorithm for constructing feasible schedules and computing their schedule times	Jack Heller	1960	Courant Institute of Mathematical Sciences, New York University
Cloud Computing: Intelligent Pricing Algorithm	Sumit Chakraborty	2012	Business Analytics Research Lab India
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1987	Sloan School of Management, Massachusetts Institute of Technology
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1988	Sloan School of Management, Massachusetts Institute of Technology
Polygon /
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
An O(n log n) algorithm for computing a link center in a simple polygon	Hristo N. Djidjev; Andrzej Lingas; Jörg-Rüdiger Sack	STACS 89: 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989; Proceedings	Burkhard Monien; Robert Cori	1989	Springer Berlin Heidelberg
Computing the Geodesic Center of a Simple Polygon	Tetsuo Asano; Godfried Toussaint	Discrete Algorithms and Complexity	David S. Johnson; Takao Nishizeki and Akihiro Nozaki	1987	Academic Press
An optimal algorithm for the rectilinear link center of a rectilinear polygon	Bengt J. Nilsson; Sven Schuierer	Algorithms and Data Structures: 2nd Workshop, WADS ' 91, Ottawa, Canada, August 14-16, 1991. Proceedings	Frank Dehne; Jörg-Rüdiger Sack; Nicola Santoro	1991	Springer Berlin Heidelberg
Computing a Geodesic Two-Center of Points in a Simple Polygon	Eunjin Oh; Sang Won Bae; Hee-Kap Ahn	LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings	Evangelos Kranakis; Gonzalo Navarro; Edgar Chávez	1st ed. 2016	Springer Berlin Heidelberg
An O(log log n) algorithm to compute the kernel of a polygon	S. Schuierer	Algorithm Theory - SWAT ' 94: 4th Scandianvian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994. Proceedings	Erik M. Schmidt; Sven Skyum	1994	Springer Berlin Heidelberg
The 2-Center Problem in a Simple Polygon	Eunjin Oh; Jean-Lou De Carufel; Hee-Kap Ahn	Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings	Khaled Elbassioni; Kazuhisa Makino	1st ed. 2015	Springer Berlin Heidelberg
An n log n algorithm for online BDD refinement	Nils Klarlund	Computer Aided Verification: 9th International Conference, CAV' 97, Haifa, Israel, June 22-25, 1997, Proceedings	Orna Grumberg	1997	Springer Berlin Heidelberg
A Log Log N Search Algorithm for Nonuniform Distributions	Dan E. Willard	Applied Probability— Computer Science: The Interface	Ralph L. Disney; Teunis J. Ott	1982	Birkhäuser Boston
Computing the rectilinear link diameter of a polygon	Bengt J. Nilsson; Sven Schuierer	Computational Geometry - Methods, Algorithms and Applications: International Workshop on Computational Geometry CG ' 91 Bern, Switzerland, March 21-22, 1991. Proceedings	Hanspeter Bieri; Hartmut Noltemeier	1991	Springer Berlin Heidelberg
An O(n log n) Algorithm for a Load Balancing Problem on Paths	Nikhil R. Devanur; Uriel Feige	Algorithms and Data Structures: 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011, Proceedings	Frank Dehne; John Iacono; Jörg-Rüdiger Sack	2011	Springer Berlin Heidelberg
A New Linear Time Algorithm for Computing the Convex Hull of a Simple Polygon	W. Hochstättler; S. Kromberg; C. Moll	Operations Research ’93: Extended Abstracts of the 18th Symposium on Operations Research held at the University of Cologne September 1–3, 1993	Achim Bachem; Ulrich Derigs; Michael Jünger; Rainer Schrader	1994	Physica-Verlag HD
An algorithm for computing An	J. P. LaSalle	The Stability and Control of Discrete Processes	J.P. LaSalle	1986	Springer New York
74 Computing Link Center and Radius of Simple Polygons		Visibility Algorithms in the Plane	Ghosh S.K.	2007
Computing simple and log returns		Python: End-to-end Data Analysis: Leverage the Power of Python to Clean, Scrape, Analyze, and Visualize Your Data: a Course in Three Modules	Phuong Vo. T. H; Phuong Vothihong	2016
Computing the center of area of a polygon	Matthew Díaz; Joseph O'; Rourke	Algorithms and Data Structures: Workshop WADS ' 89, Ottawa, Canada, August 17-19, 1989. Proceedings	Frank Dehne; Jörg-Rüdiger Sack; Nicola Santoro	1989	Springer Berlin Heidelberg
Simple Polygon		MATLAB Mapping Toolbox™ User's Guide	The MathWorks, Inc.	2020	The MathWorks, Inc.
Simple Polygon		The Kml Handbook: Geographic Visualization for the Web	Wernecke, Josie	2008;2009	Addison-Wesley Professional
An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles	Danny Z. Chen; Haitao Wang	Algorithms and Computation: 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings	Takao Asano; Shin-ichi Nakano; Yoshio Okamoto; Osamu Watanabe	2011	Springer Berlin Heidelberg
Computing the L 1-diameter and center of a simple rectilinear polygon in parallel	Sven Schuierer	Algorithm Theory - SWAT ' 94: 4th Scandianvian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994. Proceedings	Erik M. Schmidt; Sven Skyum	1994	Springer Berlin Heidelberg
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon	Tetsuo Asano; Wolfgang Mulzer; Yajun Wang	WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010, Proceedings	Md. Saidur Rahman; Satoshi Fujita	2010	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"An O(n log n) algorithm for computing a link center in a simple polygon" - similar Books and Chapters