A Dimension-Independent Representation for Multiresolution Nonmanifold Meshes

2006 ◽  
Vol 6 (4) ◽  
pp. 397-404 ◽  
Author(s):  
Leila De Floriani ◽  
Annie Hui
Keyword(s):  
Data Structure ◽  
Efficient Algorithms ◽  
Independent Data ◽  
Incidence Graph ◽  
Model Based ◽  
Multiresolution Representation ◽  
Multiple Resolutions ◽  
Simplicial Mesh ◽  
Mesh Update ◽  
Effective Representation

We consider the problem of representing and manipulating nonmanifold objects of any dimension and at multiple resolutions. We present a modeling scheme based on (1) a multiresolution representation, called the vertex-based nonmanifold multitessellation, (2) a compact and dimension-independent data structure, called the Simplified Incidence Graph (SIG), and (3) an atomic mesh update operator, called vertex-pair contraction/vertex expansion. We propose efficient algorithms for performing the vertex-pair contraction on a simplicial mesh encoded as a SIG, and an effective representation for encoding this multiresolution model based on a compact encoding of vertex-pair contractions and vertex expansions.

Computer Data Structure for Geological Entities Modelling Based on OO-Solid Model

2011 ◽  
Vol 383-390 ◽  
pp. 2484-2491
Author(s):  
Jun Fan
Keyword(s):  
Data Structure ◽  
Data Model ◽  
Object Oriented ◽  
Geological Structure ◽  
Solid Model ◽  
Topological Relations ◽  
Seamless Integration ◽  
Computer Data ◽  
Model Based ◽  
Geometric Primitives

In the long evolution of the earth formation often form a complex geological structure, modeling for these complex geological entities (such as thinning-out, bifurcation, reverse, etc.) still require in-depth 3D modeling study. Because of discontinuity, complexity and uncertainty of distribution of 3D geo-objects, some models only are suitable for regular, continuous and relatively simple spatial objects, and some are suitable for discontinue, complex and uncertain geo-objects, but some improvements on these models, such as, updating of model, maintenance of topological and seamless integration between models, are still to be made. OO-Solid model, put forward by writer in 2002, is an object- oriented topological model based on sections. The OO-Solid Model is an object-oriented 3D topologic data model based on component for geology modeling with fully considering the topological relations between geological objects and its geometric primitives, Comparatively, it accords with the actual requirements of three-dimensional geological modeling . The key issue of 3D geology modeling is the 3D data model. Some data models are suitable for discontinue, complex and uncertain geo-objects, but the OO-Solid model is an object-oriented 3D topologic data model based on component for geology modeling with fully considering the topological relations between geological objects and its geometric primitives. OO-Solid model and data structure are designed. At last, 3D complex geological entities modeling based on OO-Solid are studied in this paper. These study is important and one of the core techniques for the 3DGM.

Comparative Study on SaaS Data Layer Solution

2011 ◽  
Vol 225-226 ◽  
pp. 646-650
Author(s):  
Ya Juan Liu ◽  
Hao Yu Wen ◽  
Jun Zha
Keyword(s):  
Data Structure ◽  
Comparative Study ◽  
Business Model ◽  
System Development ◽  
Selection Strategy ◽  
Independent Data ◽  
Actual Application ◽  
Data Layer ◽  
Application Scope ◽  
Layer Solution

According to the Characteristics of the business model for SaaS, appropriate data layer solution need to be selected to the system development. Through an analysis of independent database, independent data structure and shared databases shared framework, and combining with actual application scope and scene, the selection strategy of SaaS data layer solution is given.

CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS

2009 ◽  
Vol 08 (02) ◽  
pp. 141-154
Author(s):  
LAXMI P. GEWALI ◽  
DAN MAZZELLA ◽  
HENRY SELVARAJ
Keyword(s):  
Data Structure ◽  
Simple Algorithm ◽  
Efficient Algorithms ◽  
Disjoint Paths ◽  
Disjoint Path

We address the problem of constructing a pair of node-disjoint paths connecting two given nodes in a geometric network. We propose a simple algorithm for constructing such a path that does not use any complicated data structure which can be easily implemented. We also consider two variations of disjoint path pair problems which we call narrow corridor problem and width-bounded corridor problem and present efficient algorithms for solving them.

EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON

1995 ◽  
Vol 05 (04) ◽  
pp. 433-458 ◽  
Author(s):  
SOO-HWAN KIM ◽  
SUNG YONG SHIN ◽  
KYUNG-YONG CHWA
Keyword(s):  
Data Structure ◽  
Simple Polygon ◽  
Efficient Algorithms

A diagonal guard is a guard capable of moving along an edge or an internal diagonal in a polygon. A polygon which can be guarded by a diagonal guard is called diagonal-visible. We consider the following three problems concerning the diagonal visibility in a polygon P. First, determine whether or not a guard diagonal exists in P, i.e., P is diagonal-visible. Second, compute all guard diagonals of P. Third, given a query diagonal, determine whether or not it is a guard diagonal. For these problems, we construct a data structure for keeping all guard diagonals in O(n log n) time and O(n) space. Using this data structure, we show that these problems can be solved in O(n log n), O(n log n+k), and O(1) time, respectively, where k is the number of guard diagonals.

OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM

2000 ◽  
Vol 10 (06) ◽  
pp. 581-592 ◽  
Author(s):  
BOAZ BEN-MOSHE ◽  
MATTHEW J. KATZ ◽  
MICHAEL SEGAL
Keyword(s):  
Data Structure ◽  
Facility Location ◽  
Efficient Solution ◽  
Location Problem ◽  
Facility Location Problem ◽  
Efficient Algorithms ◽  
Minimal Distance ◽  
Rectangular Region ◽  
Obnoxious Facility Location ◽  
Obnoxious Facility

We present efficient algorithms for several instances of the following facility location problem. Place k obnoxious facilities, with respect to n given demand sites and m given regions, where the goal is to maximize the minimal distance between a demand site and a facility, under the constraint that each of the regions must contain at least one facility. We also present an efficient solution to the following planar problem that arises as a subproblem. Given n transmitters, each of range r, construct a compact data structure that supports coverage queries, i.e., determine whether a query polygonal/rectangular region is fully covered by the transmitters.

On Hierarchical Linguistic-Based Clustering

2015 ◽  
Vol 19 (6) ◽  
pp. 900-906 ◽  
Author(s):  
Naohiko Kinoshita ◽  
◽  
Yasunori Endo ◽  
Akira Sugawara ◽  
◽  
...  
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Fuzzy Reasoning ◽  
Unsupervised Classification ◽  
Clustering Techniques ◽  
Model Based Clustering ◽  
Model Based ◽  
Soft Computing Techniques

Clustering is representative unsupervised classification. Many researchers have proposed clustering algorithms based on mathematical models – methods we call model-based clustering. Clustering techniques are very useful for determining data structures, but model-based clustering is difficult to use for analyzing data correctly because we cannot select a suitable method unless we know the data structure at least partially. The new clustering algorithm we propose introduces soft computing techniques such as fuzzy reasoning in what we call linguistic-based clustering, whose features are not incident to the data structure. We verify the method’s effectiveness through numerical examples.

scholarly journals Lagged Association Between Powdery Mildew Leaf Severity, Airborne Inoculum, Weather, and Crop Losses in Strawberry

2013 ◽  
Vol 103 (8) ◽  
pp. 811-821 ◽  
Author(s):  
O. Carisse ◽  
V. Morissette-Thomas ◽  
H. Van der Heyden
Keyword(s):  
Powdery Mildew ◽  
Linear Relationship ◽  
Leaf Area ◽  
Crop Loss ◽  
Independent Data ◽  
Weather Variables ◽  
Inoculum Concentration ◽  
Crop Losses ◽  
Model Based ◽  
Airborne Inoculum

Knowledge about epidemiology and the impact of disease on yield is fundamental for establishing effective management strategies. The purpose of this study was to investigate the relationship between foliar strawberry mildew severity, Podosphaera aphanis airborne inoculum concentration, weather, and subsequent crop losses for day-neutral strawberry. The experiment was conducted at three, five, and four sites in 2006, 2007, and 2008, respectively, for a total of 12 epidemics. At each site, data were collected on 25 plants at 2-day intervals from the end of May to early October for a total of 60 to 62 samplings annually. First, seasonal crop losses were statistically described; then, a lagged regression model was developed to describe crop losses from the parameters that were significantly associated with losses. There was a strong positive linear relationship between seasonal crop losses and the area under the leaf disease progress curve (R2 = 0.90) and daily mean airborne conidia concentration (R2 = 0.86), and a negative linear relationship between crop losses and time to 5% loss (R2 = 0.76) and time to 5% leaf area diseased (R2 = 0.61). Among the 53 monitoring- and weather-based variables analyzed, percent leaf area diseased, log10-transformed airborne inoculum concentration, and weather variables related to temperature were significantly associated with crop losses. However, polynomial distributed lag regression models built with weather variables were not accurate in predicting losses, with the exception of a model based on a combined temperature and humidity variable, which provided accurate prediction of the data used to construct the model but not of independent data. Overall, the model based on log10-transformed airborne inoculum concentration did not provide accurate crop loss predictions. The model built using percent leaf area diseased with a time lag of 8 days (n = 4) and a polynomial degree of 2 provided a good description of the crop-loss data used to construct the model (r = 0.99 and 0.90) and of independent data (r = 0.92). For the 12 epidemics studied, 5% crop loss was reached when an average of 17% leaf area diseased was observed since the beginning of symptom development. These results indicate that information on foliar powdery mildew must be considered when making strawberry powdery mildew management decisions.

A Novel Model for Mining Frequent Patterns Based on Embedded Granular Computing

2018 ◽  
Vol 26 (05) ◽  
pp. 741-769 ◽  
Author(s):  
Gang Fang ◽  
Jiale Wang ◽  
Hong Ying
Keyword(s):  
Data Mining ◽  
Data Structure ◽  
Granular Computing ◽  
Search Space ◽  
Frequent Patterns ◽  
Information Granule ◽  
Memory Space ◽  
Computing Model ◽  
Model Based ◽  
Mining Model

For mining frequent patterns, it is very expensive for the Apriori mining model to read the database repeatedly, and a highly condensed data structure made the FP-growth mining model cost larger memory. In order to avoid the disadvantages of these data mining model, this paper proposes a novel data mining model for discovering frequent patterns, called a data mining model based on embedded granular computing, which is different from the Apriori model and the FP-growth model. The data mining model adopts efficiently dividing and conquering from granular computing, which can construct adaptively different hierarchical granules. To form the data mining model, an embedded granular computing model is proposed in this paper. The granular computing model is used in discovering frequent patterns, on the one hand, it avoids reading the database repeatedly via constructing the extended information granule, and lessen the calculated amount of support; on the other hand, it reduces the memory requirements by the attribute granule, where the search space can compress the memory space of data structure that make the method of generating the candidate become simple relatively; and it can divide the overlarge computing task into several easy operations via the attribute granule, namely, the embedded granular computing model could short the size of the search space from a super state to several sub-states. All experimental results show that the data mining model based on embedded granular computing is more reasonable and efficient than these classical models for mining frequent patterns under these different types of datasets. Otherwise, an extra discussion describes the performance trend of the model by a group of experiments.

scholarly journals Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle

1997 ◽  
Vol 07 (01n02) ◽  
pp. 85-121 ◽  
Author(s):  
Yi-Jen Chiang ◽  
Roberto Tamassia
Keyword(s):  
Data Structure ◽  
Shortest Path ◽  
Dynamic Environment ◽  
Simple Polygon ◽  
Efficient Algorithms ◽  
Optimal Time ◽  
Convex Polygons ◽  
Separation Problem ◽  
Dynamic Case ◽  
Path Queries

We present efficient algorithms for shortest-path and minimum-link-path queries between two convex polygons inside a simple polygon P, which acts as an obstacle to be avoided. Let n be the number of vertices of P, and h the total number of vertices of the query polygons. We show that shortest-path queries can be performed optimally in time O( log h + log n) (plus O(k) time for reporting the k edges of the path) using a data structure with O(n) space and preprocessing time, and that minimum-link-path queries can be performed in optimal time O( log h + log n) (plus O(k) to report the k links), with O(n3) space and preprocessing time. We also extend our results to the dynamic case, and give a unified data structure that supports both queries for convex polygons in the same region of a connected planar subdivision [Formula: see text]. The update operations consist of insertions and deletions of edges and vertices. Let n be the current number of vertices in [Formula: see text]. The data structure uses O(n) space, supports updates in O( log 2 n) time, and performs shortest-path and minimum-link-path queries in times O( log h+ log 2n) (plus O(k) to report the k edges of the path) and O( log h + k log 2 n), respectively. Performing shortest-path queries is a variation of the well-studied separation problem, which has not been efficiently solved before in the presence of obstacles. Also, it was not previously known how to perform minimum-link-path queries in a dynamic environment, even for two-point queries.

Sign in / Sign up

Export Citation Format

Share Document