نتایج جستجو برای: Rectilinear diameter

تعداد نتایج: 113721  

Journal: :iranian journal of chemistry and chemical engineering (ijcce) 2004
azzedine abbaci

the thermodynamic properties of fluids can be predicted using the global equations of state. among these thermodynamic properties of fluids, we choose the densities of the liquid and vapor phases. this paper considers the application of the crossover model to the vapor-liquid rectilinear diameter of sulfurhexafluoride. we also present a comparison of the crossover model equation with the experi...

Journal: :CoRR 2017
Man-Kwun Chiu Elena Khramtcova Matias Korman Aleksandar Markovic Yoshio Okamoto Aurélien Ooms André van Renssen Marcel Roeloffzen

We study the computation of the diameter and radius under the rectilinear link distance within a rectilinear polygonal domain of n vertices and h holes. We introduce a graph of oriented distances to encode the distance between pairs of points of the domain. This helps us transform the problem so that we can search through the candidates more efficiently. Our algorithm computes both the diameter...

Journal: :Comput. Geom. 1991
Mark de Berg

Given a simple polygon P without holes all of whose edges are axis-parallel, a rectilinear path in P is a path that consists of axis-parallel segments only and does not cross any edge of P. The length of such a path is defined as the number of segments it consists of and the rectilinear link distance between two points in P is defined as the length of the shortest path connecting the two points...

The thermodynamic properties of fluids can be predicted using the global equations of state. Among these thermodynamic properties of fluids, we choose the densities of the liquid and vapor phases. This paper considers the application of the crossover model to the vapor-liquid rectilinear diameter of sulfurhexafluoride. We also present a comparison of the crossover model equation with ...

Journal: :The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 1912

1996
Sven Schuierer

We present a data structure that allows to preprocess a rectilinear polygon with n vertices such that, for any two query points, the shortest path in the rectilinear link or L 1-metric can be reported in time O(log n + k) where k is the link length of the shortest path. If only the distance is of interest, the query time reduces to O(log n). Furthermore, if the query points are two vertices, th...

Journal: :Discrete Applied Mathematics 1996

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید