Let${\mathcal {O}}$be a set of unit vectors (orientations) in${{\mathcal {R}}^{2}}$. A line (segment, ray) in the plane is called an${\mathcal {O}}$-line (${\mathcal {O}}$-segment,${\mathcal {O}}$-ray) if its orientation vector is collinear to a vector of${\mathcal {O}}$. Güting [3] introduced, essentially, the notion of an${\mathcal {O}}$-oriented polygon; that is, a polygon whose edges are${\mathcal {O}}$-segments.

A planar point setXis${\mathcal {O}}$-convex if the intersection ofXwith any${\mathcal {O}}$-line is empty or connected. The${\mathcal {O}}$-convex hull of a planar set is defined to be the smallest${\mathcal {O}}$-convex set that contains...

Let${\mathcal {S}}$be a set ofrbounded, convex polygons in the plane with a total ofnvertices. By apolygon, we mean the region consisting of the boundary as well as the interior. PolygonsPandQare said tointersectif they share a point; in particular, they intersect if one is completely contained inside the other or if their boundaries intersect.

We consider efficient algorithms for reporting output-sensitively (resp. counting) all intersecting pairs of polygons in${\mathcal {S}}$. Byoutput sizewe mean the number of intersecting pairs of polygons in${\mathcal {S}}$; we denote this...

The convex hull of a set of points in the plane is defined as the smallest set, or equivalently, the set of smallest perimeter that contains all the points. We consider in this paper convex hulls of bounded curvature. A curve is said of bounded curvature if it isC¹and if its curvature is upper bounded by 1 everywhere it is defined. We define a convex hull of bounded curvature of a set${\mathcal {S}}$of points in the plane as a set containing${\mathcal {S}}$and whose boundary is a curve of bounded curvature of minimal length.

Convex sets of...

Given a setSofnpoints in the plane, and given an integerk,$\frac{n}{2}\le k\le n$, we want to find the smallest axis parallel rectangle (smallest perimeter or smallest area) that encloses exactlykpoints ofS. Aggarwal et al. [2] present an algorithm for this problem for anyk≤n, which runs in timeO(k²nlogn) and usesO(kn) space. Eppstein et al. [4] and Datta et al. [3] show that this problem can be solved inO(k²n) time; the algorithm in [4] usesO(kn) space, while the algorithm in [3] uses linear space. These algorithms...

The Minimal Nested Polygon problem is defined as the following: given two simple polygons P_inand P_out, with P_incompletely contained in P_out(i.e. P_in⊂ P_out), find a nested polygon (i.e. one that is contained in the annulus between P_inand P_outand contains the inner polygon P_in) P*, that has the fewest number of edges. This problem has applications in robotics, collision avoidance, stock cutting etc. and is hence extensively studied - see [1],[2],[3],[5]. When P* is known to be non-convex, anO(n) time algorithm is given in [3] to find it, wherenis the total number...

The problem of reconstructing the boundary of a solid object from a series of parallel planar cross-sections has attracted much attention in the literature during the past two decades. The main motivations for this problem come from medical imaging applications and from geographic information systems.

The input usually consists of a series of parallel planar slices, each consisting of a collection of simple non-crossing polygons (output of an edge-detection process applied to the raw data). The goal is a polyhedral solid model whose cross-sections along the given planes coincide with the input slices. A natural simplification of the problem is...

In this paper we deal with the random generation of simple polygons on a given set of points¹: Ideally, given a set${\mathcal S}=\{{{s}_{1}},\ldots ,{{s}_{n}}\}$ofnpoints, we would like to generate a simple polygon${\mathcal {P}}$at random with a uniform distribution. In this context, a uniformly random polygon on${\mathcal {S}}$is a polygon which is generated with probability${\frac{1}{k}}$if there existksimple polygons on${\mathcal {S}}$in total. Since no polynomial-time solution is known for the uniformly random generation of simple polygons, we focus on heuristics that offer a good time complexity and still generate a rich variety of...

In the field of visibility research, theReconstruction problemrebuilds an (unknown) object from (primarily) visibility information. In the literature, various objects have been considered (e.g., points, line segments, polygons) and a variety of visibility models suggested [Eve90] [O’R87] [Wis85]. In general, visibility information alone is not sufficient to reconstruct an object and frequently extra information is provided [CL91] [Wis94].

This paper presents an algorithm that reconstructs an (unknown) orthogonal polygon inO(nlogn) time from pure visibility information - the “stab visibilities” of the vertices of the polygon. Each vertexvof a simple polygonPhas two...

Geometric modeling technology, which has developed rapidly since 1970, plays a central role in industrial CAD [5]. Solid modelers have complex data structures that are usually proprietary to the computer code used to generate them and therefore are secret. There complexity and secrecy makes it difficult to exchange data between different solid modelers. One of the easiest ways to overcome the difficulties of data exchange between solid modelers is to create a simple boundary representation (BRep) of a tessellation that covers the surface of the solid with planar triangles. In this paper, an STL tessellation of a BRep approximates a...

A graph is a triangulation if it is planar and every face is a triangle. A triangulation is rooted if the external triangular face is labelled. Two rooted triangulations with the same external face labels are isomorphic if their internal vertices can be labelled so that both triangulations have identical edge lists.

In this article, we show that in the set of rooted triangulations onnpoints with minimum degree four, there exists a target triangulation${E_{n}^{*}}$such that any other triangulation${{E}_{n}}\ne E_{n}^{*}$in the set can be transformed to${E_{n}^{*}}$via a finite sequence of single and double diagonal...

LetSbe a set ofnpoints in the plane andEdenote the set of all the line segments with endpoints inS. A line segment${\overline{pq}}$withp, q∈Sis called a stable line segment of all triangulations ofS, if no line segment inEproperly intersects${\overline{pq}}$. The intersection of all possible triangulations ofSthen is the set of all stable line segments inS, denoted bySL(S).

As a combinatorial problem, various properties of stable line segments of a set of planar points have been investigated in [Xu92]. It is...

LetSbe a set ofnpoints in the plane. A triangulationT(S) ofSis a maximal set of non-intersecting edges connecting points inS(that is, the addition of one more edge would create an intersection). The weight of an edge inT(S) is the Euclidean distance between its endpoints. The weight ofT(S) is the sum of the weight of its edges. Computing the minimum weight triangulationMWT(S) of a point setSis an old open problem. In fact, the complexity of this problem remains unresolved. It is not known to be NP-complete or polynomial-time...

A simple polygon in the plane is typically represented by means of an ordered list of the real-valued coordinates of its vertices. Although such a representation completely describes the polygon it may not be convenient to store and manipulate. Alternatively then, we may wish to compute and store only that combinatorial information about the polygon required for a particular application. Three well known combinatorial objects defined for simple polygons are the convex hull, the internal visibility graph and the external visibility graph.

Now suppose that we are given a combinatorial object. We ask whether there is a simple polygon which...

The following easy reduction is well known. LetCbe a finite set of parallel line segments in ℝ^d. We want to find a (d− 1)-transversalforC, that is, a hyperplane intersecting every segment inC. Such a hyperplane has to pass below the upper endpoint of each segment and above the lower endpoint. In the dual, the endpoints correspond to linear halfspaces, and the intersection of these halfspaces corresponds to the set of hyperplane transversals of the parallel segments in the primal. So the problem is solved by linear programming in dimensiond, in linear time if...

Let${\mathcal {S}}$be a set ofn d-dimensional geometric objects. We say that${\mathcal {S}}$is stabbed bykpoints if there existkpoints so that each object of${\mathcal {S}}$contains at least one of these points. Given a set${\mathcal {S}}$as above, finding the minimumkso that${\mathcal {S}}$can be stabbed bykpoints has been shown to be NP-complete [FPTB1] as soon asd≥ 2¹. Therefore this problem is intractable even for small values ofn. This problem is also referenced in the literature as thecovering set problem(or dually as thehitting set problem)...

The transversal or stabbing problem is well-studied in computational geometry and has applications in image processing, robotics, hidden surface removal in graphics, etc. Given a number of objects distributed on a two- or three-dimensional region, the objective is to check whether a common transversal i.e., a straight line segment palssing through all the objects exists, and if so, determine the same. Edelsbrunner, Overmars and Wood [5] developed a method for computing the transversal inE², if it exists, inO(n²logn) time andO(n) space, wherenis the number of objects. However anO(nlogn) time algorithm...

In this paper we address to the well-known post-office problem. The post-office problem is stated as fo1lows [18].

The post-office problem: Given a setSofnpqints in R^k, store it in a data structure such that for any query pointp∈ R^k, we can efficiently find itsnearest neighbor, i.e., a pointp^∞∈Sthat is closest top,

d(p, p^∞) = min{d(p, q) :q∈S}.

In the dynamic version of problem the setpis dynamically changed by insertions and deletions of points. It is an open problem [17, 21] if there exists...

The algorithm in this paper belongs to an incremental type. At first, we introduce some definitions and notations. In this paper, polygon is considered as a simple closed chain of line segments.

Letg_ibe a point, a line segment, a segment chain or a polygon for eachi(1 ≤i≤N). Let us assume that eachg_iis simple and anyg_i,g_j(i≠j) do not intersect.

We also assume that the set$\{{{g}_{1}},\cdots, {{g}_{n}}\}$is a plane graph in which the degree of any vertex is at most 2. We call the set${{G}=\{{g}_{1}},\cdots, {{g}_{N}}\}$a...

Voronoi diagrams are an important construct in computational geometry. In high-dimensional Euclidean spaces, there are few studies of Voronoi diagrams under convex distance functions other than the Euclidean one. In this paper, we continue the study of general convex distance functions initiated in [4, 6], where only smooth distance functions are considered. The reasons for this study are: 1. To generalize the abstract Voronoi diagram from 2-space [5] to 3-space, we need to know structural properties of bisectors, as well as of their intersections. The work of Boissonnatet al[2] indicates that a direct approach to computing Voronoi diagrams...

Recently, an elegant and powerful architecture has been obtained by adding one bus to every row and to every column in the mesh, as illustrated in Figure 1. In [7] an abstraction of such a system is referred to asmesh with multiple broadcasting. The mesh with multiple broadcasting has been implemented in VLSI and is commercially available in the DAP family of multicomputers [7, 12]. In turn, due to its commercial availability, the mesh with multiple broadcasting has attracted a great deal of attention. Applications ranging from image processing [7, 12], to computer graphics and robotics [3, 11], to...

We consider the following problem. A set of 2ndistinct points,S_i, T_i, i= 1, …, n, in the plane is given. The pointsS= {S_i} lie on the boundary of a convex polygonPwith verticesV; the pointsT= {T_i} lie in its interior. Each pair of points (S_i, T_i) is connected by a polygonal line (polyline, for short)PL_ithat begins atS_i(theinitial vertex) and ends atT_i(thefinal vertex). In addition, each polyline may have any number ofinternal vertices. These vertices are members of the setTand are...

Objects in geometric path planning problems are usually divided intomoving objectsandfixedones calledobstacles. In a problem description the moving objects and the obstacles are given - usually as polygons or polyhedra - together with their positions and orientations. For the moving objects goal configurations are specified additionally to complete the problem description.

Much work has been done to solve this kind of problems (→ classical path planning algorithm CPPA). In early papers it has been shown that the problem is decidable for an arbitrary number of moving objects [10]. In subsequent work the focus of interest...

In this paper we investigate a three-dimensional hidden surface removal problem with respect to a moving point of view. Consider a situation where you want to compute the perspective view of a set of fixed nonintersecting spheres in 3-space from a sequence of viewpoints lying on a linear fiightpath. Such a situation arises for example in molecular graphics. Here, a molecule is often modeled as the union of atoms, each represented by a sphere of its van der Waals radius. The possibility of viewing such molecules from a prespecified linear flightpath in 3-space can provide valuable insights into their spatial...

Arrangements, such as the decomposition of the plane into regions by a set ofnlines, are central to much of the research on algorithms in computational geometry. They express a large number of geometric features that have a highly regular structure, such as the$\left( _{2}^{n} \right)$intersections between pairs of lines. Powerful techniques, such as ∊-nets, random sampling, lower envelopes, and implicit representation, have been developed that use the regularity to look at less than the full structure of the arrangements in solving problems on arrangements [3, 4]. These techniques are most applicable to problems of a combinatorial nature; they...

The problem of motion planning is to determine the existence of a path for a moving object from a given source point to a desired destination point, avoiding collision with any obstacles in the environment. The static domain, where the obstacles are stationary, has been studied extensively in [12], [6] and [4]. More specifically, the problem of computing the Euclidean shortest length path in the plane amidst stationary obstacles has been studied in [8], [10], [5] and [9]. Tools such as the visibility graph and the shortest path map have been used to map the connectivity of free space and...

Geometric spanners are data structures that approximate the complete graph on a set of points in thed-dimensional space ℝ^d, in the sense that the shortest path (based on such a spanner) between any pair of given points is not more than a factor oftlonger than the distance between the points in ℝ^d.

Letτbe a constant such that 1 ≤τ≤ ∞. We measure distances between points in ℝ^dwith theL_τ-metric, whered≥ 1 is a constant. LetSbe a set ofnpoints in ℝ^d. We consider graphsG= (V,...

Ann-link chainis a sequence ofnrigid rods consecutively connected together at their endjoints, about which the rods may rotate freely. This paper considers the reachability properties of the endjoints of chains confined inside convex polygons.

Figure 1 illustrates ann-link chain Γ with jointsA₀, …,A_n. Herel_idenotes the length of linkL_i= [A_i−1,A_i]. JointsA₀andA_nare calledendjointsand the others are calledintermediate joints.

We denote max_1≤i≤n{l_i} byl_maxand say that Γ isboundedbyb, denoted by Γ ≺b, ifl_max<b.

We propose a strong notion...

This work is based on a simple but general path search strategy for spaces of arbitrary dimension. It is a heuristic algorithm for the generalized movers’ problem that doesnot explicitlycompute or represent configuration space but rather utilizes a collision detection subroutine for inquiries about possible paths. The approach uses divide-and-conquer and can be applied to many concrete situations, e.g. to motion planning for a single rigid body moving freely, a jointed robot arm, or even several objects moving concurrently. The fundamental idea is described in [Sch92] and will be investigated and refined here; we show how to handle...

Let${\mathcal {C}}$denote a family of Jordan curves in the plane. Two setsPandQin the plane are${\mathcal {C}}$-separable if there exists$\xi \in {\mathcal {C}}$, such that every point of one of these sets lies in the closed region insideξ, and every point of the other set lies in the closed region outsideξ. In this paper we restrict our consideration to elements of${\mathcal {C}}$being circles. A circleC(X,r), with centerXand radiusr, separatingPfromQis said to be a largest separating circle if there is a neighbourhoodBofX...

Thesweep techniquehas proved to be one of the most powerful paradigms in Computational and Combinatorial Geometry, especially when dealing with problems in the 2-dimensional Euclidean plane. In most cases the plane is swept by a straight line whose normal vector never changes its direction. Such aplane sweepis calledtranslational. In some other cases it is more appropriate to perform arotationalplane sweep, i.e. the plane is swept by rotating a straight line or halfline (ray) around a point.

Starting from previous works by J.E. Goodman and R. Pollack ([GoPo80], [GoPo93]) one of the authors studied...

LetP_n= {P1, … ,P_n} be a set ofnpoints on the plane. We say thatP_nsupportsa planar graphG(V, E) if there is a plane embedding ofG(V, E) on the plane in such a way that its vertices are mapped to the elements ofP_nand its edges to straight line segments connecting pairs of adjacent vertices. Given two point setsP_nandQ_n, the problem of finding graphs supported by both of them has received attention recently. For example, Aronov, Seidel and Souvaine [1] and Kranakis and Urrutia [5] studied the problem of...

In this paper, we consider the overlay of plane subdivisions (a classical problem in computational geometry) and extend it to the case of hierarchically represented subdivisions.

The problem, in this new setting, has relevance in geographic information systems, where plane subdivisions are used to represent maps, and the combination (overlay) of two maps, describing different characteristics of the same spatial domain, is a fundamental operation. The need for multiresolution arises, because huge amounts of data are available, while not all application tasks require the same level of detail. Hierarchical subdivisions compactly encode decompositions of a plane domain at multiple resolutions,...

A number of industries generate new parts by cutting them from stock material: cloth, leather (hides), sheet metal,etc. These industries require good solutions to containment problems.Containmentis the question of whether a given set of part shapes can be fit, without overlapping, into a given container. The shapes and container are represented as polygons and may be nonconvex. Material such as cloth has a grain, and it sometimes has a “nap” (e.g.velvet or corduroy) or a colored pattern (e.g.stripes or plaid). A part cut out of such material has only one, two, four, or possibly eight...

Multiresolution geometric models can be used in several application fields to support the representation and processing of geometric entities at different levels of resolution. The case of topographic surfaces is especially attractive for its impact on applications like geographic information systems, and virtual reality contexts. For instance, visualization in flight simulation can be made faster by rendering portions of terrain close to the observer at high resolution, while far portions are rendered at lower resolution.

In this paper we consider polyhedral terrains defined by a triangulation of a plane domain, where each vertex has an elevation value, and each triangle...

The study of convex sets is a branch of geometry that has applications in optimization, statistics, geometric number theory, and combinatorics [8], as well as in more practical areas, such as VLSI design, computer graphics, architectural databases, geographic databases, and motion planning. Researchers have explored a number of nonstandard notions of convexity, driven by application areas. Some examples are: orthogonal convexity [6, 7], NESW convexity [5, 13], finitely oriented convexity [4, 10], and link convexity [1, 12].

Rawlins introduced the notion ofrestricted-orientation convexity, also calledO-convexity, in his doctoral thesis, as a generalization of standard convexity [9]. Rawlins, Wood,...

Victor Klee originally posed the problem of determining the minimum number of guards sufficient to cover the interior of ann-sided art gallery (polygon) in 1973. Chvátal showed that ⌊n/3⌋ guards are sufficient and sometimes necessary to cover the interior of ann-sided art gallery using a lengthy combinatorial argument [4]. Subsequently, Fisk [8] gave a concise and elegant proof using the fact that the vertices of a triangulated polygon may be three-colored. Since then, this problem has evolved into what is virtually a new field of study with numerous variations of the original question. The reader is referred to...

With the word polygon we refer to a closed set which includes interior and boundary points. If the line segment connecting two points of a polygonPlies entirely inP, we say that they arevisiblefrom each other. A polygonPiscoveredby a set of viewpoints, orguards, lying inp, if each point inPis visible from at least one guard.

The research in this area was triggered in 1975 by Chvatal’s ”Art Gallery” Theorem[3]. He proved that at mostg(n)=⌊n/3⌋ guards are required for covering a simple polygonPwithnedges. The...

Let${\mathcal {R}}=\{{{R}_{i}}\}$be a collection of pairwise disjoint closed rectangles in the plane. Two rectanglesR_iandR_jwill be calledVisibleif there is a closed nondegenerate rectangular regionB_ij(called aband of visibility) such that one side ofB_ijis contained in a side ofR_i, the opposite side ofB_ijis contained in a side ofR_j, andB_ijdoes not intersect the interior of any rectangle in${\mathcal {R}}$. This type of visibility is equivalent to what Tamassia and Tollis have called ∊-visibility [8]. Thevisibility graph of${\mathcal {R}}$is the graph of the visibility...

In this paper, we study the following problem: Given a scene with ann-vertex simple polygonPand a trajectory path in the plane, report the perspective view from each of a sequence of successive points on the trajectory. We present conceptually simple and optimal algorithms for the cases of this problem in which the trajectory path consists of several line segments or of a conic curve that contains the polygon. Intuitively, the polygonPcould represent the “opaque” walls of a building.

The general problem of computing visibility information of a geometric scene along a trajectory arises in several...

The visibility graph of a set of nonintersecting line segments G in the plane is a graph whose vertices are the endpoints of the segments and whose edges are the pairs of endpoints (u,v) such that the open line segment between u and v does not intersect any of the line segments of G.

Asano et al. [AGHI86] and Welzl [We185] presented optimal algorithms for constructing the visibility graph fornline segments inO(n²) time. Hershberger [Her89] studied the visibility graph of triangulated simple polygon withnsides. He described an algorithm that finds the visibility graph inO(m)...

We consider the dynamic problems of computing

approximate nearest neighbor,

approximatek-nearest neighbor,

approximate range searching,

approximate furthest neighbor and

approximate diameter.

The nearest neighbor searching is one of the fundamental problems in computational geometry. We are given a setSofnpoints in R^d,d≥ 2, and a distance metricL_t, 1 ≤t≤ ∞. It is assumed that the dimensiondis a constant independent ofn. Each pointpis given as ad-tuple of real numbers (p₁, … ,p_d). Letdist(p,q) denote the distance between pointspandq.

Definition 1.1 Given...

The study of convex sets is a branch of geometry that has numerous connections with other areas of mathematics, including analysis, linear algebra, statistics, and combinatorics [4]. Its importance stems from the fact that convex sets arise in many areas of mathematics and are often amenable to rather elementary reasoning. The concept of convexity serves to unify a wide range of mathematical phenomena.

The application of convexity theory to practical problems led to the exploration of nontraditional notions of convexity, such as orthogonal convexity [6], finitely oriented convexity [5], and link convexity [1, 9]. These nontraditional convexities are used in...

A major topic of geometric optimization is to approximate point sets by simple geometric figures. This includes extensively studied planar problems such as smallest enclosing circles, the minimum width annulus, and the minimum width slab. In higher dimensions, there are few non-trivial complexity results for geometric figures beyond hyperplanes or spheres. In this paper, we consider the following:

Smallest Cylinder Problem (P1): LetIbe a given set ofnpoints in 3-space. Find a line ℓ which minimizes max{d(ℓ,c) :c∈I}.

Here,d(ℓ,c) denotes the minimum Euclidean distance betweencandapoint of...

Proving the lower bounds of problems is one of the central part in algorithm theory. Established lower bound for a specific problem usually convinces people not to try obtaining better algorithms unless under a different model of computation or when some extra primitives are allowed. In computational geometry (as well as in the general algorithm design area) lower bound is usually obtained via problem reduction, probablistic argument, combinatorial counting. However, in general the lower bound results are very sparse compared with the vast upper bound results in computational geometry [Cha94].

We briefly mention three techniques for proving lower bounds in...

Consider an idealized robot hand, consisting of several independently movable force-sensing fingers; this hand is used to grasp a rigid objectB. Each finger contacts the object only at one point onBand can apply a positive force. We assume that at that point the normal toBis unique, and that the contact is frictionless. We wish to find agrasp: a set of points on the boundary ofB. The fingers will then apply forces at these points to grasp the object. In general, we want the number of fingers to be small. Another desirable characteristic of...

Let P be a polygon and I a set of n points (pins) in the plane. We say that I immobilizes P if any rigid motion of P in the plane forces at least one of the pins of I to penetrate the interior of P. As for small motion only pins from the boundary of P may penetrate it, we will suppose that all pins actually belong to the boundary of the polygon. A rigid motion of polygon P in the plane is a mapping M (different from identity) from the set t×P (t represents time) to the plane,...

In the process of designing efficient algorithms, we are faced with the problem of trying to lower known time-bounds, or finding what the real lower bounds are for a given problem. It might be useful to know that a problem we are trying to solve is, at least, as difficult as another well-studied,verydifficult one. Some classes of difficult problems have been found, where the NP-complete class is, maybe, the best known. Inside computational geometry, a large number of problems have been identified for which it is impossible to obtain subquadratic algorithms, unless one manages to improve the complexity...

Orthogonal graph drawings are an important tool for graph layout, since the minimum angle of 90° makes the drawings easily readable. Specific uses include Data Flow Diagrams and Entity Relationships Diagrams. The precise definition is as follows:

Anorthogonal drawingof a graph is an embedding in the plane such that vertices are drawn as points and edges are drawn as sequences of horizontal and vertical line segments. A point where the drawing of an edge changes its direction is called abendof this edge. We assume that all vertices and bends are placed on points with integer coordinates....

Anembeddingof a graphG= (V,E) is a mapping of the vertices ofGonto different points in the plane and the edges ofGonto line segments that preserves the incidence relation between edges and vertices. Therefore an edgeuvwill be mapped onto the line segment linking the corresponding points ofuandv. Furthermore, the point corresponding to a vertexvwill not lie on any line segment that does not correspond to an edge incident withvinG. Figure 1 gives three different embeddings of a path with five vertices. We refer...

A (2-dimensional) orthogonal drawing of a graph is a drawing such that every vertex is drawn as a point in the plane, and every edge is drawn as a sequence of horizontal and vertical lines. Orthogonal graph drawings are an important layout tool, for example to display Data Flow Diagrams and Entity Relationships Diagrams. Two of the most important measurements of the quality of a drawing are the grid-size and the number of bends. Orthogonal drawings exist only if every vertex in the graph has at most four incident edges, such a graph is called a4-graph. On the other...

LetP_nbe a set of points on the plane in general position, andGa graph withnvertices. We say thatP_nsupportsGif there is an embedding ofGon the plane in such a way that the vertices ofGare mapped to the elements ofP_n, and its edges to non-intersecting open straight line segments joining pairs of elements ofP_nwhich correspond to pairs of adjacent vertices inG. We call any such embedding a straight-line embedding ofGonP_n.

In 1990, Perles introduced the problem of embedding rooted trees on point...

We present an algorithm for reporting the new points incorporated by on-line sequences of nested rectangular range queries. We assume the rectangular regions in a sequence have the same orientation but this orientation may be different for each sequence and is not known in advance (see Figure 1). The problem is formally stated as follows:

Extending Rectangular Range Reporting Problem: Given a set ofNpoints inR_dand an on-line sequence of d-dimensional rectangular query regionsQ_l, … ,Q_Ealigned with some arbitrary orthogonal coordinate system and eachQ_icompletely containingQ_i−l, for thei(th) extended query, report...

Terrain drainage characteristics provide important information on water resources, possible flood areas, erosion and other natural processes. In natural resource management, for example, the basic management unit is thewatershed, the area around a stream that drains into the stream. Road building, logging, or other activities carried out in a watershed all have the potential to affect the defining stream. Manual quantification of terrain drainage characteristics is a tedious and time consuming job. Fortunately, through spatial analysis of digital representations of surfaces, they can be, by and large, inferred automatically.

In this note, we survey some of the literature on...

Manufactured objects are always approximations to some ideal object: parts that are supposed to be flat will not be perfectly flat, round parts will not be perfectly round, and so on. In many situations, however, it is important that the manufactured object is very close to the ideal object. In such cases the specification of an object includes a description of how far the manufactured object is allowed to deviate from the ideal one. The field of dimensional tolerancing [2] provides the language for this. Given a specification, one must test whether the manufactured object meets it, which is the...

In most illumination problems, visibility from a point is allowed in all directions (360° angular aperture). Recently, several researchers have considered illumination problems that restrict visibility to within a certain angular aperture [3,4,5]. A light source whose illumination angle is restricted toα-degrees is called anα-flood-light (or simplyα-light). A simple polygon may remain unilluminated even if we place a 90º-flood-light at each vertex; and this holds true even if the polygon is restricted to be monotone [4]. Estivill-Castro et. al. [5] presented a surprise on polygon illumination: there are simple polygons (called logarithmic spirals) that can not be...