A pseudo-triangle is a simple polygon with exactly three convex vertices. A pseudo-triangulation of a finite point set S in the plane is a partition of the convex hull of S into interior disjoint pseudo-triangles whose vertices are points of S. A pointed pseudo-triangulation is one which has the least number of pseudo-triangles. We study the graph G whose vertices represent the pointed pseudo-t...

We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first present an O(n log n)-time algorithm that produces a pseudo-triangulation of weight O(wt(M(S)) · log n) which is shown to be asymptotically worstcase optimal, i.e., there exists a point set S for which every pseudotriangulation has weight Ω(log n · wt(M(S))), where wt(M(S)) i...

Porosity is a key parameter for reservoir evaluation. Inferring the porosity from seismic data often challenging and prone to uncertainties due number of factors. The main aim this paper show applicability inversion on old vintage map spatial at level. 3D-seismic wireline log are used properties Lower Goru productive sands in Gambat Latif block, Central Indus Basin, Pakistan. formation was inte...

Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T ′ of TS are adjacent if T intersects T ′ only in points of S or in common edges. We prove that the diameter of TS is O(log k), where k denotes the number of convex layers of S. Based on this result, we show that the flip graph PS of pseudo-triangulations...

Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing the longest maximal concave chain. We consider two versions of the problem: First, we assume that the three convex vertices of the pseudotriangle are given. Let n denote the number of points that lie inside the convex ...

Net pay thickness is defined as that portion of a reservoir which contains economically producible hydrocarbons with today’s technology, prices, and costs. This thickness is a key parameter of the volumetric calculation of in-place hydrocarbons, well test interpretation, and reservoir characterization. A reservoir interval is considered as net pay when it contains hydrocarbons that can flow at ...

We prove that the intersection hypergraph of a family of n pseudo-disks with respect to another family of pseudo-disks admits a proper coloring with 4 colors and a conflict-free coloring with O(log n) colors. Along the way we prove that the respective Delaunay-graph is planar. We also prove that the intersection hypergraph of a family of n regions with linear union complexity with respect to a ...

Paradigm shift in hydrocarbon exploration and development strategies has increased utilization of seismic data many fold for reservoir characterization. Complicated and nonlinear relationship between seismic attributes and reservoir properties has been addressed recently using artificial neural network techniques for lithofaices classification and prediction of reservoir properties through unsu...

Abstract The application of machine learning methods is aimed at providing efficiency and avoiding subjectivity in estimating reservoir porosity data. This study proposes the eXtreme Gradient Boost (XGBoost) algorithm which known to be effective accurate predictions a short time for porosity. model was optimized using GridSearchCV (GS) module, then applied 7 wells from Damar field, Indonesia wi...