Abstract
The study of convex sets is a branch of geometry, analysis and linear algebra, which has numerous connections with other areas of mathematics, including topology, number theory and combinatorics [6, 14, 21]. Researchers have explored not only mathematical properties of convex sets, but also related computational problems [5, 13, 34], and applied the resulting algorithms in many practical areas, such as graphics, finite-element analysis, VLSI design and motion planning. They have also studied several types of nontraditional convexity, such as ortho-convexity [28, 30], restricted-orientation convexity [35], NESW convexity [25, 49, 50] and link convexity [2, 52].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fink, E., Wood, D. (2004). Introduction. In: Restricted-Orientation Convexity. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18849-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-18849-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62323-3
Online ISBN: 978-3-642-18849-7
eBook Packages: Springer Book Archive