Results 1  10
of
3,068
Restrictedorientation Halfspaces
"... Restrictedorientation convexity, also called Oconvexity, is the study of geometric objects whose intersection with lines from some fixed set is empty or connected. We introduce restrictedorientation halfspaces, which are an Oconvexity analog of halfspaces, explore their properties, and demonstra ..."
Abstract
 Add to MetaCart
Restrictedorientation convexity, also called Oconvexity, is the study of geometric objects whose intersection with lines from some fixed set is empty or connected. We introduce restrictedorientation halfspaces, which are an Oconvexity analog of halfspaces, explore their properties
Fundamentals of restrictedorientation convexity
 Information Sciences
, 1996
"... Abstract A restrictedorientation convex set, also called an Oconvex set, is a set of points whose intersection with lines from some fixed set is empty or connected. The notion of Oconvexity generalizes standard convexity and orthogonal convexity. We explore some of the basic properties of Oconve ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
Abstract A restrictedorientation convex set, also called an Oconvex set, is a set of points whose intersection with lines from some fixed set is empty or connected. The notion of Oconvexity generalizes standard convexity and orthogonal convexity. We explore some of the basic properties of O
Line Simplification with Restricted Orientations
, 1999
"... We study the Corieted lie simplifi'catio problem: Given a polygonal chain P represented by an ordered set of vertices Pl,...,Pn in the plane, a set of orientations C, and a constant e, we search for a "Coriented" polygonal chain Q consisting of the minimum number of line segments ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
segments that has distance at most e to P in the Frdchet metric. A polygonal chain is Coriented if the line segments are parallel to orientations in C. We restrict our attention to the version of the problem where two circles of radius e formed around adjacent vertices of the polygonal chain do
Strong RestrictedOrientation Convexity
, 1995
"... Strong Oconvexity is a generalization of standard convexity, defined with respect to a fixed set O of hyperplanar orientations. We explore the properties of strongly Oconvex sets in two and more dimensions and develop a mathematical foundation of strong convexity. In doing so, we characterize s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Strong Oconvexity is a generalization of standard convexity, defined with respect to a fixed set O of hyperplanar orientations. We explore the properties of strongly Oconvex sets in two and more dimensions and develop a mathematical foundation of strong convexity. In doing so, we characterize
Restricted Orientation Visibility
, 1991
"... Let O be some set of orientations, i.e., O ` [0 ffi ; 360 ffi ). In this paper we look at the consequences of defining visibility based on curves that are monotone w.r.t. to the orientations in O. We call such curves Ostaircases. Two points p and q in a polygon P are said to O s see each oth ..."
Abstract
 Add to MetaCart
Let O be some set of orientations, i.e., O ` [0 ffi ; 360 ffi ). In this paper we look at the consequences of defining visibility based on curves that are monotone w.r.t. to the orientations in O. We call such curves Ostaircases. Two points p and q in a polygon P are said to O s see each
ThreeDimensional RestrictedOrientation Convexity
, 1996
"... A restrictedorientation convex set, also called an Oconvex set, is a set of points whose intersection with lines from some fixed set is empty or connected. This notion generalizes standard convexity and orthogonal convexity. We explore some of the basic properties of O convex sets in three dim ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A restrictedorientation convex set, also called an Oconvex set, is a set of points whose intersection with lines from some fixed set is empty or connected. This notion generalizes standard convexity and orthogonal convexity. We explore some of the basic properties of O convex sets in three
Generalized halfspaces in restrictedorientation convexity
 JOURNAL OF GEOMETRY
, 1995
"... Restrictedorientation convexity, also called Oconvexity, is the study of geometric objects whose intersection with lines from some fixed set is empty or connected. The notion ofOconvexity generalizes standard convexity and several types of nontraditional convexity. We introduce Ohalfspaces, whic ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Restrictedorientation convexity, also called Oconvexity, is the study of geometric objects whose intersection with lines from some fixed set is empty or connected. The notion ofOconvexity generalizes standard convexity and several types of nontraditional convexity. We introduce O
RestrictedOrientation Convexity in HigherDimensional Spaces ABSTRACT
"... A restrictedoriented convex set is a set whose intersection with any line from a fixed set of orientations is either empty or connected. This notion generalizes both orthogonal convexity and normal convexity. The aim of this paper is to establish a mathematical foundation for the theory of restrict ..."
Abstract
 Add to MetaCart
A restrictedoriented convex set is a set whose intersection with any line from a fixed set of orientations is either empty or connected. This notion generalizes both orthogonal convexity and normal convexity. The aim of this paper is to establish a mathematical foundation for the theory
The nesC language: A holistic approach to networked embedded systems
 In Proceedings of Programming Language Design and Implementation (PLDI
, 2003
"... We present nesC, a programming language for networked embedded systems that represent a new design space for application developers. An example of a networked embedded system is a sensor network, which consists of (potentially) thousands of tiny, lowpower “motes, ” each of which execute concurrent, ..."
Abstract

Cited by 943 (48 self)
 Add to MetaCart
, reactive programs that must operate with severe memory and power constraints. nesC’s contribution is to support the special needs of this domain by exposing a programming model that incorporates eventdriven execution, a flexible concurrency model, and componentoriented application design. Restrictions
Faster algorithms for minimumlink paths with restricted orientations
 In WADS’11
, 2011
"... Abstract. We give an O(n 2 log 2 n)time algorithm for computing a minimumlink rectilinear path in an nvertex rectilinear domain in three dimensions; the fastest previously known algorithm of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We give an O(n 2 log 2 n)time algorithm for computing a minimumlink rectilinear path in an nvertex rectilinear domain in three dimensions; the fastest previously known algorithm of
Results 1  10
of
3,068