In scientific illustrations and visualization, cutaway views are often employed as an effective technique for occlusion management in densely packed scenes. We propose a novel method for authoring cutaway illustrations of mesoscopic biological models. In contrast to the existing cutaway algorithms, we take advantage of the specific nature of the biological models. These models consist of thousa...

In general, visibility reconstruction problems involve determining a set of objects in the plane that exhibit a speci ed set of visibility constraints. In this paper, an algorithm for reconstructing a set of parallel line segments is presented, from speci ed visibility information contained in an extended endpoint visibility graph. The algorithm runs in polynomial time and relies on simple vect...

In this paper, we give a characterization of the visibility graphs of pseudo-polygons. We first identify some key combinatorial properties of pseudo-polygons, and we then give a set of five necessary conditions based off our identified properties. We then prove that these necessary conditions are also sufficient via a reduction to a characterization of vertex-edge visibility graphs given by O’R...

The problem of aggregation is considerable importance in many disciplines. In this paper, a new type of operator called visibility graph averaging (VGA) aggregation operator is proposed. This proposed operator is based on the visibility graph which can convert a time series into a graph. The weights are obtained according to the importance of the data in the visibility graph. Finally, the VGA o...

Let P be a simple polygon with n vertices. We present a new O(n)-time algorithm to compute the visible part of one edge from another edge of P . The algorithm does not alter the input and only uses O(1) variables and is therefore a constant-workspace algorithm. The algorithm can be used to make a constant-workspace algorithm for computing the weak visibility polygon from an edge in O(mn) time, ...

The visibility graph V(X) of a discrete point set X ⊂ R has vertex set X and an edge xy for every two points x, y ∈ X whenever there is no other point in X on the line segment between x and y. We show that for every graphG, there is a point setX ∈ R, such that the subgraph of V(X∪Z) induced by X is isomorphic to G. As a consequence, we show that there are visibility graphs of arbitrary high chr...

We present a lighting method for outdoor scenes with vegetation. The method is compatible with multiresolution trees generated using random L-systems. We include a sky dome model that gets the luminance and chromaticity values at several sampling points for different time and location. The samples are used to compute the light arriving to the objects in the scene depending on the insolation con...

This paper describes our experience in using a multimedia project management and software engineering environment, Decision-based Hyper-multimedia CASE (DHC), to support the Low-Visibility Landing and Surface Operations (LVLASO) project at the NASA Langley Research Center. 1 The purpose of the LVLASO project is to allow pilots to land and taxi airplanes when visibility is impeded due to adverse...

At the same time, many product development organizations today are burdened with a wide array of disparate application lifecycle management (ALM) tools acquired over time and incrementally bundled together to automate the myriad of high-ceremony development processes. The resulting environment is one fraught with redundancy, inefficiency, error, escalating costs, compliance issues and lack of v...

Single trocar transanal endoscopic surgery (STTE) is a well-known technique for evaluation and management of rectal lesions in adults. We used an 11mm balloon trocar with a 10mm operative optic, introduced into the anal canal to excise a rectal lesion along with multiple rectal biopsies in a child. Rectal visibility was good with an ease to maintain the rectum insufflated.