EATCS Monographs on Theoretical Computer Science
Polski English Login or register account. Eugene Fink , Derick Wood. Source Monographs in Theoretical Computer Science. Abstract Restricted-orientation convexity is the study of geometric objects whose intersections with lines from some fixed set are connected. Assign yourself or invite other person as author. It allow to create list of users contirbution.
Monographs and Texts
Assignment does not change access privileges to resource content. You're going to remove this assignment.
- Thor: The Mighty Avenger Vol. 1!
- Le Grand livre de la tendresse (Essais/Clés) (French Edition).
- Product details.
University of South Florida, Dept. Additional information Copyright owner: The book closes with suggestions and conjectures for the direction of future research.
Oops! That page can’t be found.
Reay, Mathematical Reviews, Issue j. Eugene Fink received his B. His research interests include computational geometry, artificial intelligence, machine learning, and e-commerce. Derick Wood received his B. He has published widely in a number of research areas and written two textbooks, "Theory of Computation" John Wiley, and "Data Structures, Algorithms, and Performance" Addison-Wesley, Would you like to tell us about a lower price?
If you are a seller for this product, would you like to suggest updates through seller support? Learn more about Amazon Prime. Read more Read less. Prime Book Box for Kids. Review From the reviews: Monographs in Theoretical Computer Science. Springer; Softcover reprint of the original 1st ed.
Be the first to review this item Amazon Best Sellers Rank: Strong ortho-hull b and strong ortho-kernel c. Standard convex hull a and strong O-hull b. Standard convex hull a and O-hull b.
- Page not found - Harvest Fellowship Church.
- Unknown error.
- User assignment;
Directed O-halfplane a and nondirected O-halfplane b. Two types of generalized visibility in the plane. Worst-case time complexity for the three notions of visibility. Sweep-line view of the strong O-visibility computation. Constructing the O-block of two given points. Three cases when points are not strongly O-visible to each other.
Standard kernel, strong O-kernel and inner halfblocks of a polygon. Construction of a strong O-visibility polygon for point obstacles. Generalized visibility in three dimensions.
- You May Not Know Me Now;
- INFONA - science communication portal;
- Soldati senza causa: Memorie della guerra dAlgeria (Quadrante Laterza) (Italian Edition).
- EATCS Monographs and Texts?
Orthogonal projections of O-connected and O-convex sets onto O-planes. O-halfplane a and O-halfspace b whose boundaries are not O-convex.
Nondirected O-halfspace with an O-connected boundary. O-halfplane b whose closed complement c is not an O-halfplane. Proofs of Theorem 5. Directed O-halfspaces b,c and a nondirected O-halfspace d.