The pairwise intersection problem for monotone polygons.

1986 ◽  
Author(s):  
David B. Levine
Keyword(s):  
Intersection Problem ◽  
Pairwise Intersection ◽  
Monotone Polygons

Orthogonal Trades and the Intersection Problem for Orthogonal Arrays

2015 ◽  
Vol 32 (3) ◽  
pp. 903-912
Author(s):  
Fatih Demirkale ◽  
Diane M. Donovan ◽  
Selda Küçükçifçi ◽  
Emine Şule Yazıcı
Keyword(s):  
Orthogonal Arrays ◽  
Intersection Problem

Study on Stability for Intersection of Deep Soft Rock Roadway

2011 ◽  
Vol 243-249 ◽  
pp. 2666-2669
Author(s):  
Zhan Jin Li ◽  
Yang Zhang ◽  
Xue Li Zhao
Keyword(s):  
Coal Mine ◽  
Soft Rock ◽  
Intersection Problem ◽  
The Third ◽  
Geological Conditions ◽  
Control Stability ◽  
Soft Rock Roadway ◽  
Crossing Point ◽  
Coupling Support ◽  
Rock Roadway

With the depth increasing continuously, more complicated of geological conditions, will make intersection in deep soft rock roadway is very difficult to support. In order to solve the intersection problem of difficult to support, combined with the third levels of the Fifth Coal Mine of Hemei, the coupling supporting design—anchor-mesh-cable + truss to control stability of crossing point—is proposed. Based software of FLAC3D, simulate the program applicable in deep soft rock roadway intersection. Application results show that the coupling support technology of anchor-mesh-cable + truss can effectively control the deformation of intersection in deep soft rock roadway.

MOAA and Topology Judgment for Mesh Construction

2004 ◽  
Author(s):  
Wen-Jie Cheng ◽  
Arzu Gonenc Sorguc ◽  
Junichi Shinoda ◽  
Ichiro Hagiwara
Keyword(s):  
Topology Optimization ◽  
Data Set ◽  
Basic Principles ◽  
Intersection Problem ◽  
Line Segments ◽  
Original Surface ◽  
Aspect Ratios ◽  
And Topology ◽  
Maximum Angle ◽  
Data Points

In this paper, the Maximum Opposite Angulation Approach (MOAA) for 3-D including the topology optimization is discussed. The MOAA algorithm is developed to generate meshes in 2-D and 3-D. The basic principles of the algorithm both in 2-D applications and in 3-D applications, is to pre-set uniformity to the initial data set to form point pairs yielding possible shortest line segments. These line segments are connected with the points providing the maximum angle for the vertex of the triangular mesh to be constructed. Thus, the algorithm provides triangular meshes having well balanced interior angles and good aspect ratios. The MOAA algorithm can be proved similar to the Delaunay’s approach in 2-D from the principle and with the quickest speed. In 3-D, it was also shown that it is much more efficient than many Delaunay class algorithms with mesh architectures preserving the topology, for uniformly organized data points. In this study, the topology optimization together with the MOAA algorithm is presented to improve the precision of reconstruction of the original surface. In this context, topology judgment for intersection problem in 3-D, distortion phenomenon, the possibility of loosing some characteristics of the original surface is thoroughly investigated.

scholarly journals Strongly Possible Keys for SQL

2020 ◽  
Vol 9 (2-3) ◽  
pp. 85-99
Author(s):  
Munqath Alattar ◽  
Attila Sali
Keyword(s):  
Data Mining ◽  
Missing Values ◽  
Possible World ◽  
Bipartite Matching ◽  
Matroid Intersection ◽  
Intersection Problem ◽  
Data Mining Approach ◽  
Data Value ◽  
Two Measures ◽  
Matroid Intersection Problem

Abstract Missing data value is an extensive problem in both research and industrial developers. Two general approaches are there to deal with the problem of missing values in databases; they could be either ignored (removed) or imputed (filled in) with new values (Farhangfar et al. in IEEE Trans Syst Man Cybern-Part A: Syst Hum 37(5):692–709, 2007). For some SQL tables, it is possible that some candidate key of the table is not null-free and this needs to be handled. Possible keys and certain keys to deal with this situation were introduced in Köhler et al. (VLDB J 25(4):571–596, 2016). In the present paper, we introduce an intermediate concept called strongly possible keys that is based on a data mining approach using only information already contained in the SQL table. A strongly possible key is a key that holds for some possible world which is obtained by replacing any occurrences of nulls with some values already appearing in the corresponding attributes. Implication among strongly possible keys is characterized, and Armstrong tables are constructed. An algorithm to verify a strongly possible key is given applying bipartite matching. Connection between matroid intersection problem and system of strongly possible keys is established. For the cases when no strongly possible keys hold, an approximation notion is introduced to calculate the closeness of any given set of attributes to be considered as a strongly possible key using the $$g_3$$ g 3 measure, and we derive its component version $$g_4$$ g 4 . Analytical comparisons are given between the two measures.

GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY

2004 ◽  
Vol 14 (04n05) ◽  
pp. 311-339 ◽  
Author(s):  
DANNY Z. CHEN ◽  
XIAOBO S. HU ◽  
SHUANG (SEAN) LUAN ◽  
CHAO WANG ◽  
XIAODONG WU
Keyword(s):  
Radiation Therapy ◽  
Polynomial Time ◽  
Geometric Algorithms ◽  
Planning System ◽  
Treatment Planning System ◽  
Polygonal Domain ◽  
Steiner Points ◽  
Delivery Times ◽  
Leaf Sequencing ◽  
Monotone Polygons

The static leaf sequencing (SLS) problem arises in radiation therapy for cancer treatments, aiming to accomplish the delivery of a radiation prescription to a target tumor in the minimum amount of delivery time. Geometrically, the SLS problem can be formulated as a 3-D partition problem for which the 2-D problem of partitioning a polygonal domain (possibly with holes) into a minimum set of monotone polygons is a special case. In this paper, we present new geometric algorithms for a basic case of the 3-D SLS problem (which is also of clinical value) and for the general 3-D SLS problem. Our basic 3-D SLS algorithm, based on new geometric observations, produces guaranteed optimal quality solutions using O(1) Steiner points in polynomial time; the previously best known basic 3-D SLS algorithm gives optimal outputs only for the case without considering any Steiner points, and its time bound involves a multiplicative factor of a factorial function of the input. Our general 3-D SLS algorithm is based on our basic 3-D SLS algorithm and a polynomial time algorithm for partitioning a polygonal domain (possibly with holes) into a minimum set of x-monotone polygons, and has a fast running time. Experiments of our SLS algorithms and software in clinical settings have shown substantial improvements over the current most popular commercial treatment planning system and the most well-known SLS algorithm in medical literature. The radiotherapy plans produced by our software not only take significantly shorter delivery times, but also have a much better treatment quality. This proves the feasibility of our software and has led to its clinical applications at the Department of Radiation Oncology at the University of Maryland Medical Center. Some of our techniques and geometric procedures (e.g., for partitioning a polygonal domain into a minimum set of x-monotone polygons) are interesting in their own right.

scholarly journals ON THE FIELD INTERSECTION PROBLEM OF SOLVABLE QUINTIC GENERIC POLYNOMIALS

2010 ◽  
Vol 06 (05) ◽  
pp. 1047-1081 ◽  
Author(s):  
AKINARI HOSHI ◽  
KATSUYA MIYAKE
Keyword(s):  
Arbitrary Field ◽  
Intersection Problem ◽  
Generic Polynomials ◽  
General Method

We study a general method of the field intersection problem of generic polynomials over an arbitrary field k via formal Tschirnhausen transformation. In the case of solvable quintic, we give an explicit answer to the problem by using multi-resolvent polynomials.

scholarly journals On a restricted cross-intersection problem

2006 ◽  
Vol 113 (7) ◽  
pp. 1536-1542 ◽  
Author(s):  
Peter Keevash ◽  
Benny Sudakov
Keyword(s):  
Intersection Problem

scholarly journals Rotationally monotone polygons

2009 ◽  
Vol 42 (5) ◽  
pp. 471-483
Author(s):  
Prosenjit Bose ◽  
Pat Morin ◽  
Michiel Smid ◽  
Stefanie Wuhrer
Keyword(s):  
Monotone Polygons
Sign in / Sign up

Export Citation Format

Share Document