Robotics Research Technical Report: Nonlinearity of Davenport-Schinzel, Sequences and of Generalized, Path Compression Schemes (Classic Reprint) - Hardcover

Sergiu Hart

Hardcover

ISBN 10: 0483849472 ISBN 13: 9780483849471

Publisher: Forgotten Books, 2018

Synopsis

Explore the math behind drawing and data structure limits with Davenport–Schinzel sequences and generalized path compressions.

This book reveals how these concepts connect to the lower envelope of function families and the efficiency of tree-based algorithms, with clear results and practical implications.

This work shows how alternating function intersections lead to tight bounds and why those bounds matter for computational geometry, data structure design, and algorithm analysis. It presents key theories, proofs, and the surprising role of Ackermann-type growth in complexity questions, all framed for readers with a solid math background.

• How Davenport–Schinzel sequences model envelope problems in geometry
• What generalized path compressions on trees reveal about compression schemes
• How Ackermann’s function and its inverse influence upper and lower bounds
• Connections between theory and algorithmic performance in practice

Ideal for readers of advanced topics in computational geometry, data structures, and theoretical computer science who want a rigorous treatment with clear conclusions and open questions.

Edition details

• Publisher: Forgotten Books
• Publication date: 2018
• Language: English
• ISBN 10: 0483849472
• ISBN 13: 9780483849471
• Binding: Hardcover
• Number of pages: 39