"Computing in linear time a chord from which a simple polygon is weakly internally visible"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Computing external-farthest neighbors for a simple polygon	Pankaj K. Agarwal	1989	Courant Institute of Mathematical Sciences, New York University
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
On the geodesic Voronoi diagram of point sites in a simple polygon.	Boris Aronov	1988	Courant Institute of Mathematical Sciences, New York University
Polygon /
Singularly Perturbed and Weakly Coupled Linear Control Systems: A Recursive Approach	Zoran Gajic; Djordjija Petkovski; Xuemin Shen	1990	Springer Berlin Heidelberg
Quantum Computing: From Linear Algebra to Physical Realizations	Mikio Nakahara	2008	Routledge
Simply Simple Computing	Arnold P. Reid	February 1995	Sigma Press
A Chord in Time: The Evolution of the Augmented Sixth from Monteverdi to Mahler	Mark Ellis	2010	Routledge
Ubiquitous Computing in Education: Invisible Technology,Visible Impact	Karen Swan	September 14, 2006	Lawrence Erlbaum Associates
Modeling Time in Computing	Carlo A. Furia; Dino Mandrioli; Angelo Morzenti; Matteo Rossi	2012	Springer Berlin Heidelberg
Advanced linear-programming computing techniques	W. Orchard-Hays	1968	McGraw-Hill
Simple digital computing examples	Malcolm S. Gregory	1971	Butterworths
Gardeners Weakly	HUGH SILVEY	2010	Ravette Publishing Ltd
Sage Accounts Made Simple (Made Simple Computing)	P. K. McBride	September 3, 2002	Made Simple
MS-DOS Made Simple (Computing Made Simple)	Ian Robertson Sinclair	August 17, 1994	Made Simple
Notes of a case in which chrysophanic acid was administered internally by accident	Glaister, John	1881	[s.n.]
Time and Eternity in Jewish Mysticism: That Which is Before and That Which is After	Brian Ogren (Volume Editor)	2015-01-30	Brill
Polygon Mesh Processing	Mario Botsch; Leif Kobbelt; Mark Pauly; Pierre Alliez; Bruno Levy	2010	Routledge
Polygon milking parlors	William G. Bickert	1980	University of Illinois at Urbana-Champaign, Cooperative Extension Service;Iowa State University at Ames, Cooperative Extension Service
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
Computing in linear time a chord from which a simple polygon is weakly internally visible	Binay K. Bhattacharya; Asish Mukhopadhyay	Algorithms and Computations: 6th International Symposium, ISAAC ' 95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings.	John Staples; Peter Eades; Naoki Katoh; Alistair Moffat	1995	Springer Berlin Heidelberg
A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible	Binary K. Bhattacharya; Asish Mukhopadhyay; Godfried T. Toussaint	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
Finding all weakly-visible chords of a polygon in linear time	Gautam Das; Paul J. Heffernan; Giri Narasimhan	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
Optimally computing the shortest weakly visible subedge of a simple polygon preliminary version	Danny Z. Chen	Algorithms and Computation: 4th International Symposium, ISAAC ' 93, Hong Kong, December 15-17, 1993. Proceedings	Kam W. Ng; Prabhakar Raghavan; N.V. Balasubramanian; Francis Y.L. Chin	1993	Springer Berlin Heidelberg
Computing a shortest watchman path in a simple polygon in polynomial-time	Svante Carlsson; Håkan Jonsson	Algorithms and Data Structures: 4th International Workshop, WADS ' 95, Kingston, Canada, August 16 - 18, 1995. Proceedings	Selim G. Akl; Frank Dehne; Jörg-Rüdiger Sack; Nicola Santoro	1995	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
chord traverse polygon		Dictionary Geotechnical Engineering/Wörterbuch GeoTechnik	Helmut Herrmann; Herbert Bucksch	2nd ed. 2014	Springer Berlin Heidelberg
Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time	Sang Won Bae; Matias Korman; Yoshio Okamoto; Haitao Wang	LATIN 2014: Theoretical Informatics: 11th Latin American Symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings	Alberto Pardo; Alfredo Viola	2014	Springer Berlin Heidelberg
Finding the medial axis of a simple polygon in linear time	Francis Chin; Jack Snoeyink; Cao An Wang	Algorithms and Computations: 6th International Symposium, ISAAC ' 95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings.	John Staples; Peter Eades; Naoki Katoh; Alistair Moffat	1995	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
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
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
Reconstructing a Simple Polygon from Its Angles	Yann Disser; Matúš Mihalák; Peter Widmayer	Algorithm Theory - SWAT 2010: 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings	Haim Kaplan	2010	Springer Berlin Heidelberg
271 PATHS IN A SIMPLE POLYGON		Handbook of discrete and computational geometry	Goodman J.E., O'Rourke J. (eds.)	2004	CRC
271 Paths In A Simple Polygon		Handbook of discrete and computational geometry, Second Edition	Jacob E. Goodman, Joseph O'Rourke	2004	Chapman & Hall/CRC
Weakly positive continuous-time linear systems	T. Kaczorek	Progress in System and Robot Analysis and Control Design	Spyros G. Tzafestas; Günther Schmidt	1999	Springer London
A concurrent time-stamp scheme which is linear in time and space	Amos Israeli; Meir Pinhasov	Distributed Algorithms: 6th International Workshop, WDAG ' 92, Haifa, Israel, November 2-4, 1992. Proceedings	Adrian Segall; Shmuel Zaks	1992	Springer Berlin Heidelberg
Simple Chord Progressions		A Creative Approach to Music Fundamentals, Tenth Edition	William Duckworth	2009	Schirmer
A simple two-chord progression		PIANO EXERCISES FOR DUMMIES.	DAVID PEARL	2022	JOHN WILEY
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Computing in linear time a chord from which a simple polygon is weakly internally visible" - similar Books and Chapters