Restricted-Orientation Convexity [electronic resource] /

Restricted-orientation convexity is the study of geometric objects whose intersections with lines from some fixed set are connected. This notion generalizes standard convexity and several types of nontraditional convexity. We explore the properties of this generalized convexity in multidimensional Euclidean space, describes restricted-orientation analogs of lines, hyperplanes, flats, and halfspaces, and identify major properties of standard convex sets that also hold for restricted-orientation convexity. We then introduce the notion of strong restricted-orientation convexity, which is an alternative generalization of convexity, and show that its properties are also similar to those of standard convexity.

Saved in:
Bibliographic Details
Main Authors: Fink, Eugene. author., Wood, Derick. author., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004
Subjects:Computer science., Computers., Algorithms., Computer graphics., Convex geometry., Discrete geometry., Computer Science., Computation by Abstract Devices., Algorithm Analysis and Problem Complexity., Computer Graphics., Convex and Discrete Geometry.,
Online Access:http://dx.doi.org/10.1007/978-3-642-18849-7
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:193545
record_format koha
spelling KOHA-OAI-TEST:1935452018-07-30T23:18:46ZRestricted-Orientation Convexity [electronic resource] / Fink, Eugene. author. Wood, Derick. author. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,2004.engRestricted-orientation convexity is the study of geometric objects whose intersections with lines from some fixed set are connected. This notion generalizes standard convexity and several types of nontraditional convexity. We explore the properties of this generalized convexity in multidimensional Euclidean space, describes restricted-orientation analogs of lines, hyperplanes, flats, and halfspaces, and identify major properties of standard convex sets that also hold for restricted-orientation convexity. We then introduce the notion of strong restricted-orientation convexity, which is an alternative generalization of convexity, and show that its properties are also similar to those of standard convexity.1 Introduction -- 1.1 Standard Convexity -- 1.2 Ortho-Convexity -- 1.3 Strong Ortho-Convexity -- 1.4 Convexity Spaces -- 1.5 Book Outline -- 2 Two Dimensions -- 2.1 O-Convex Sets -- 2.2 O-Halfplanes -- 2.3 Strongly O-Convex Sets -- 3 Computational Problems -- 3.1 Visibility and Convexity Testing -- 3.2 Strong O-Hull -- 3.3 Strong O-Kernel -- 3.4 Visibility from a Point -- 4 Higher Dimensions -- 4.1 Orientation Sets -- 4.2 O-Convexity and O-Connectedness -- 4.3 O-Connected Curves -- 4.4 Visibility -- 5 Generalized Halfspaces -- 5.1 O-Halfspaces -- 5.2 Directed O-Halfspaces -- 5.3 Boundary Convexity -- 5.4 Complementation -- 6 Strong Convexity -- 6.1 Strongly O-Convex Sets -- 6.2 Strongly O-Convex Flats -- 6.3 Strongly O-Convex Halfspaces -- 7 Closing Remarks -- 7.1 Main Results -- 7.2 Conjectures -- 7.3 Future Work -- References.Restricted-orientation convexity is the study of geometric objects whose intersections with lines from some fixed set are connected. This notion generalizes standard convexity and several types of nontraditional convexity. We explore the properties of this generalized convexity in multidimensional Euclidean space, describes restricted-orientation analogs of lines, hyperplanes, flats, and halfspaces, and identify major properties of standard convex sets that also hold for restricted-orientation convexity. We then introduce the notion of strong restricted-orientation convexity, which is an alternative generalization of convexity, and show that its properties are also similar to those of standard convexity.Computer science.Computers.Algorithms.Computer graphics.Convex geometry.Discrete geometry.Computer Science.Computation by Abstract Devices.Algorithm Analysis and Problem Complexity.Computer Graphics.Convex and Discrete Geometry.Springer eBookshttp://dx.doi.org/10.1007/978-3-642-18849-7URN:ISBN:9783642188497
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Computer science.
Computers.
Algorithms.
Computer graphics.
Convex geometry.
Discrete geometry.
Computer Science.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Convex and Discrete Geometry.
Computer science.
Computers.
Algorithms.
Computer graphics.
Convex geometry.
Discrete geometry.
Computer Science.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Convex and Discrete Geometry.
spellingShingle Computer science.
Computers.
Algorithms.
Computer graphics.
Convex geometry.
Discrete geometry.
Computer Science.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Convex and Discrete Geometry.
Computer science.
Computers.
Algorithms.
Computer graphics.
Convex geometry.
Discrete geometry.
Computer Science.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Convex and Discrete Geometry.
Fink, Eugene. author.
Wood, Derick. author.
SpringerLink (Online service)
Restricted-Orientation Convexity [electronic resource] /
description Restricted-orientation convexity is the study of geometric objects whose intersections with lines from some fixed set are connected. This notion generalizes standard convexity and several types of nontraditional convexity. We explore the properties of this generalized convexity in multidimensional Euclidean space, describes restricted-orientation analogs of lines, hyperplanes, flats, and halfspaces, and identify major properties of standard convex sets that also hold for restricted-orientation convexity. We then introduce the notion of strong restricted-orientation convexity, which is an alternative generalization of convexity, and show that its properties are also similar to those of standard convexity.
format Texto
topic_facet Computer science.
Computers.
Algorithms.
Computer graphics.
Convex geometry.
Discrete geometry.
Computer Science.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Convex and Discrete Geometry.
author Fink, Eugene. author.
Wood, Derick. author.
SpringerLink (Online service)
author_facet Fink, Eugene. author.
Wood, Derick. author.
SpringerLink (Online service)
author_sort Fink, Eugene. author.
title Restricted-Orientation Convexity [electronic resource] /
title_short Restricted-Orientation Convexity [electronic resource] /
title_full Restricted-Orientation Convexity [electronic resource] /
title_fullStr Restricted-Orientation Convexity [electronic resource] /
title_full_unstemmed Restricted-Orientation Convexity [electronic resource] /
title_sort restricted-orientation convexity [electronic resource] /
publisher Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
publishDate 2004
url http://dx.doi.org/10.1007/978-3-642-18849-7
work_keys_str_mv AT finkeugeneauthor restrictedorientationconvexityelectronicresource
AT woodderickauthor restrictedorientationconvexityelectronicresource
AT springerlinkonlineservice restrictedorientationconvexityelectronicresource
_version_ 1756266483227295744