The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis (Classic Reprint) - Softcover

Janos Pach

Softcover

ISBN 10: 1332208444 ISBN 13: 9781332208449

Publisher: Forgotten Books, 2019

Synopsis

Excerpt from The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis

Theorem l': The combinatorial complexity of the upper envelope of n trian gles scattered in R3 is at most and this bound is asymptotically tight.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

About this title

About the Author

About the authors JANOS PACH is Professor of Computer Science at City College of New York and Senior Research Fellow at the Mathematical Institute of the Hungarian Academy of Sciences. He received his PhD in mathematics from Eotvos University, Budapest, in 1980 and has had visiting positions at various universities, including the University College of London, McGill University, the Courant Institute of New York University, and Tel Aviv University. He serves on the editorial boards of three mathematical and computer science journals and has been an invited speaker at many conferences. He has published more than one hundred research papers, mostly in discrete and computational geometry and in combinatorics. He received the Lester R. Ford Award in 1990 and the Renyi Prize in 1993. PANKAJ K. AGARWAL is Associate Professor in the Computer Science Department of Duke University. He received his PhD in computer science from the Courant Institute of Mathematical Sciences, New York University, in 1989. He is the author of Intersection and Decomposition Algorithms for Planar Arrangements, and a coauthor of Davenport--Schinzel Sequences and Their Geometric Applications. He has published several research papers and has given talks at many conferences. He was awarded the National Young Investigator Award in 1992.

Edition details

• Publisher: Forgotten Books
• Publication date: 2019
• Language: English
• ISBN 10: 1332208444
• ISBN 13: 9781332208449
• Binding: Paperback
• Number of pages: 47