Journal of Computational and Applied Mathematics, ISSN 0377-0427, 06/2016, Volume 299, pp. 35 - 49

This paper concerns Poisson equation in a polyhedral domain with corners and edges. We apply the least-squares finite element method to the reformulated...

Non-convex polyhedron | Weighted-norm | Least-squares finite element method | MATHEMATICS, APPLIED | GENERAL EDGE ASYMPTOTICS | PARTIAL-DIFFERENTIAL-EQUATIONS | SINGULARITIES | BOUNDARY-VALUE-PROBLEMS | SYSTEMS | SATURATED SUBSURFACE FLOW | FOSLS | Finite element method | Methods | Computer simulation | Least squares method | Mathematical analysis | Norms | Poisson equation | Mathematical models | Boundaries

Non-convex polyhedron | Weighted-norm | Least-squares finite element method | MATHEMATICS, APPLIED | GENERAL EDGE ASYMPTOTICS | PARTIAL-DIFFERENTIAL-EQUATIONS | SINGULARITIES | BOUNDARY-VALUE-PROBLEMS | SYSTEMS | SATURATED SUBSURFACE FLOW | FOSLS | Finite element method | Methods | Computer simulation | Least squares method | Mathematical analysis | Norms | Poisson equation | Mathematical models | Boundaries

Journal Article

Science of Computer Programming, ISSN 0167-6423, 01/2017, Volume 133, pp. 74 - 87

Abstract interpretation using convex polyhedra is a common and powerful program analysis technique to discover linear relationships among variables in a...

Convex polyhedra | Numerical abstract domains | Abstract interpretation | Widening | Wrapping | COMPUTER SCIENCE, SOFTWARE ENGINEERING | Embedded systems | Analysis | Teknik och teknologier | Computer Systems | Engineering and Technology | Elektroteknik och elektronik | Datorsystem | Electrical Engineering, Electronic Engineering, Information Engineering

Convex polyhedra | Numerical abstract domains | Abstract interpretation | Widening | Wrapping | COMPUTER SCIENCE, SOFTWARE ENGINEERING | Embedded systems | Analysis | Teknik och teknologier | Computer Systems | Engineering and Technology | Elektroteknik och elektronik | Datorsystem | Electrical Engineering, Electronic Engineering, Information Engineering

Journal Article

Stochastic Processes and their Applications, ISSN 0304-4149, 2007, Volume 117, Issue 8, pp. 1014 - 1036

We study long time asymptotic properties of constrained diffusions that arise in the heavy traffic analysis of multiclass queueing networks. We first consider...

[formula omitted]-Irreducibility | Functional central limit theorems | Heavy traffic | Moment stability | Geometric ergodicity | Poisson equation | Semimartingale reflecting Brownian motion | [formula omitted]-Uniform ergodicity | Constrained diffusions | φ-Irreducibility | V-Uniform ergodicity | constrained diffusions | STABILITY | phi-irreducibility | CONVEX DUALITY | STATISTICS & PROBABILITY | ORTHANT | geometric ergodicity | moment stability | QUEUING-NETWORKS | functional central limit theorems | SKOROKHOD PROBLEM | sernimartingale reflecting Brownian motion | heavy traffic | REFLECTING BROWNIAN MOTIONS | V-uniform ergodicity | Semimartingale reflecting Brownian motion [phi]-Irreducibility V-Uniform ergodicity Geometric ergodicity Constrained diffusions Heavy traffic Poisson equation Moment stability Functional central limit theorems

[formula omitted]-Irreducibility | Functional central limit theorems | Heavy traffic | Moment stability | Geometric ergodicity | Poisson equation | Semimartingale reflecting Brownian motion | [formula omitted]-Uniform ergodicity | Constrained diffusions | φ-Irreducibility | V-Uniform ergodicity | constrained diffusions | STABILITY | phi-irreducibility | CONVEX DUALITY | STATISTICS & PROBABILITY | ORTHANT | geometric ergodicity | moment stability | QUEUING-NETWORKS | functional central limit theorems | SKOROKHOD PROBLEM | sernimartingale reflecting Brownian motion | heavy traffic | REFLECTING BROWNIAN MOTIONS | V-uniform ergodicity | Semimartingale reflecting Brownian motion [phi]-Irreducibility V-Uniform ergodicity Geometric ergodicity Constrained diffusions Heavy traffic Poisson equation Moment stability Functional central limit theorems

Journal Article

Granular Matter, ISSN 1434-5021, 2/2013, Volume 15, Issue 1, pp. 85 - 93

The geometry of convex polyhedra is described by a set of half spaces. This geometry representation is used in the discrete element method to model polyhedral...

Geoengineering, Foundations, Hydraulics | Soft and Granular Matter, Complex Fluids and Microfluidics | Half space representation | Materials Science, general | Engineering Thermodynamics, Heat and Mass Transfer | Engineering Fluid Dynamics | Industrial Chemistry/Chemical Engineering | DEM | Physics | Convex polyhedral particles | LIGGGHTS | PACKINGS | MECHANICS | PHYSICS, APPLIED | MATERIALS SCIENCE, MULTIDISCIPLINARY | SOLIDS | MODEL | SIMULATION | Analysis | Methods | Algorithms | Half spaces | Computer simulation | Hoppers | Polyhedrons | Mathematical models | Discrete element method | Representations | Contact

Geoengineering, Foundations, Hydraulics | Soft and Granular Matter, Complex Fluids and Microfluidics | Half space representation | Materials Science, general | Engineering Thermodynamics, Heat and Mass Transfer | Engineering Fluid Dynamics | Industrial Chemistry/Chemical Engineering | DEM | Physics | Convex polyhedral particles | LIGGGHTS | PACKINGS | MECHANICS | PHYSICS, APPLIED | MATERIALS SCIENCE, MULTIDISCIPLINARY | SOLIDS | MODEL | SIMULATION | Analysis | Methods | Algorithms | Half spaces | Computer simulation | Hoppers | Polyhedrons | Mathematical models | Discrete element method | Representations | Contact

Journal Article

Journal of Global Optimization, ISSN 0925-5001, 11/2019, Volume 75, Issue 3, pp. 789 - 811

Generalized polyhedral convex optimization problems in locally convex Hausdorff topological vector spaces are studied systematically in this paper. We...

Mathematics | Duality | 90C48 | Optimization | Generalized polyhedral convex optimization problem | 90C46 | 90C25 | Operations Research/Decision Theory | Locally convex Hausdorff topological vector space | Optimality condition | 49N15 | Computer Science, general | Solution existence | Real Functions | Medical colleges | Theorems | Existence theorems | Convexity | Vector spaces | Convex analysis | Mathematical programming

Mathematics | Duality | 90C48 | Optimization | Generalized polyhedral convex optimization problem | 90C46 | 90C25 | Operations Research/Decision Theory | Locally convex Hausdorff topological vector space | Optimality condition | 49N15 | Computer Science, general | Solution existence | Real Functions | Medical colleges | Theorems | Existence theorems | Convexity | Vector spaces | Convex analysis | Mathematical programming

Journal Article

Mathematical Programming, ISSN 0025-5610, 11/2018, Volume 172, Issue 1, pp. 139 - 168

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen...

Convex MINLP | Theoretical, Mathematical and Computational Physics | Mathematics | Disciplined convex programming | Mathematical Methods in Physics | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | 90–08 | 90C25 | Numerical Analysis | 90C11 | Outer approximation | Combinatorics | BRANCH | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | NONLINEAR PROGRAMS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SOFTWARE | Analysis | Algorithms | Computational geometry | Solvers | Modelling | Convexity | Convex analysis | Optimization | Mathematical programming | Mathematics - Optimization and Control

Convex MINLP | Theoretical, Mathematical and Computational Physics | Mathematics | Disciplined convex programming | Mathematical Methods in Physics | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | 90–08 | 90C25 | Numerical Analysis | 90C11 | Outer approximation | Combinatorics | BRANCH | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | NONLINEAR PROGRAMS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SOFTWARE | Analysis | Algorithms | Computational geometry | Solvers | Modelling | Convexity | Convex analysis | Optimization | Mathematical programming | Mathematics - Optimization and Control

Journal Article

The Journal of Geometric Analysis, ISSN 1050-6926, 4/2017, Volume 27, Issue 2, pp. 1029 - 1064

In convex geometry, the Blaschke surface area measure on the boundary of a convex domain can be interpreted in terms of the complexity of approximating...

Abstract Harmonic Analysis | Fourier Analysis | Convex and Discrete Geometry | Affine surface area measure | Global Analysis and Analysis on Manifolds | Polyhedral approximations | Strongly pseudoconvex domains | Mathematics | Differential Geometry | Dynamical Systems and Ergodic Theory | Fefferman hypersurface measure | 32T15 | MATHEMATICS | SMOOTH CONVEX-BODIES | POWER DIAGRAMS

Abstract Harmonic Analysis | Fourier Analysis | Convex and Discrete Geometry | Affine surface area measure | Global Analysis and Analysis on Manifolds | Polyhedral approximations | Strongly pseudoconvex domains | Mathematics | Differential Geometry | Dynamical Systems and Ergodic Theory | Fefferman hypersurface measure | 32T15 | MATHEMATICS | SMOOTH CONVEX-BODIES | POWER DIAGRAMS

Journal Article

Mathematical Programming, ISSN 0025-5610, 06/2005, Volume 103, Issue 2, pp. 225 - 249

A variety of nonlinear, including semidefinite, relaxations have been developed in recent years for nonconvex optimization problems. Their potential can be...

Numerical and Computational Methods | Convexity identification | Mathematical and Computational Physics | Mathematics | Optimization | Mathematical Methods in Physics | Mixed-integer nonlinear programming | Mathematics of Computing | Convexification | Numerical Analysis | Calculus of Variations and Optimal Control | Factorable programming | Operation Research/Decision Theory | Outer approximation | Combinatorics | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | convexity identification | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | CONVEX-BODIES | APPROXIMATION | outer approximation | ALGORITHM | convexification | INTEGER NONLINEAR PROGRAMS | mixed-integer nonlinear programming | factorable programming | Studies | Optimization algorithms | Polyhedra | Nonlinear programming | Mathematical programming

Numerical and Computational Methods | Convexity identification | Mathematical and Computational Physics | Mathematics | Optimization | Mathematical Methods in Physics | Mixed-integer nonlinear programming | Mathematics of Computing | Convexification | Numerical Analysis | Calculus of Variations and Optimal Control | Factorable programming | Operation Research/Decision Theory | Outer approximation | Combinatorics | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | convexity identification | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | CONVEX-BODIES | APPROXIMATION | outer approximation | ALGORITHM | convexification | INTEGER NONLINEAR PROGRAMS | mixed-integer nonlinear programming | factorable programming | Studies | Optimization algorithms | Polyhedra | Nonlinear programming | Mathematical programming

Journal Article

Journal of Scientific Computing, ISSN 0885-7474, 12/2018, Volume 77, Issue 3, pp. 1339 - 1370

In this paper we present efficient quadrature rules for the numerical approximation of integrals of polynomial functions over general polygonal/polyhedral...

65D30 | Computational Mathematics and Numerical Analysis | Polygonal/polyhedral meshes | Algorithms | Numerical integration | hp -discontinuous Galerkin method | 65L60 | Theoretical, Mathematical and Computational Physics | 65D32 | Mathematical and Computational Engineering | Mathematics | hp-discontinuous Galerkin method | MATHEMATICS, APPLIED | DOMAIN DECOMPOSITION PRECONDITIONERS | GAUSSIAN QUADRATURE-RULES | 2ND-ORDER ELLIPTIC PROBLEMS | DISCRETIZATIONS | ORDER | CONVEX | DIFFERENCE METHOD | DIFFUSION-PROBLEMS | CONVERGENCE | POLYGONS | Finite element method | Methods | Differential equations

65D30 | Computational Mathematics and Numerical Analysis | Polygonal/polyhedral meshes | Algorithms | Numerical integration | hp -discontinuous Galerkin method | 65L60 | Theoretical, Mathematical and Computational Physics | 65D32 | Mathematical and Computational Engineering | Mathematics | hp-discontinuous Galerkin method | MATHEMATICS, APPLIED | DOMAIN DECOMPOSITION PRECONDITIONERS | GAUSSIAN QUADRATURE-RULES | 2ND-ORDER ELLIPTIC PROBLEMS | DISCRETIZATIONS | ORDER | CONVEX | DIFFERENCE METHOD | DIFFUSION-PROBLEMS | CONVERGENCE | POLYGONS | Finite element method | Methods | Differential equations

Journal Article

Computational Methods in Applied Mathematics, ISSN 1609-4840, 10/2016, Volume 16, Issue 4, pp. 667 - 683

We combine theoretical results from polytope domain meshing, generalized barycentric coordinates, and finite element exterior calculus to construct scalar- and...

41A25 | 41A30 | 65D05 | Generalized Barycentric Coordinates | Polygonal Finite Element Methods | Finite Element Exterior Calculus | 65N30 | INTERPOLATION | ELLIPTIC PROBLEMS | MATHEMATICS, APPLIED | DIFFERENTIAL FORMS | SPACES | CONVEX POLYGONS | WHITNEY FORMS | EXTERIOR CALCULUS | POLYTOPES

41A25 | 41A30 | 65D05 | Generalized Barycentric Coordinates | Polygonal Finite Element Methods | Finite Element Exterior Calculus | 65N30 | INTERPOLATION | ELLIPTIC PROBLEMS | MATHEMATICS, APPLIED | DIFFERENTIAL FORMS | SPACES | CONVEX POLYGONS | WHITNEY FORMS | EXTERIOR CALCULUS | POLYTOPES

Journal Article

Numerical Functional Analysis and Optimization, ISSN 0163-0563, 04/2018, Volume 39, Issue 5, pp. 537 - 570

Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related...

face | generalized polyhedral convex function | generalized polyhedral convex set | separation theorem | Conjugate function | infimal convolution | finite representation | MATHEMATICS, APPLIED | BANACH-SPACES | MATHEMATICAL PROGRAMS | OPTIMIZATION | OPTIMALITY CONDITIONS | FORMULAS | Economic models | Convolution | Convexity | Vector spaces | Convex analysis | Goal programming

face | generalized polyhedral convex function | generalized polyhedral convex set | separation theorem | Conjugate function | infimal convolution | finite representation | MATHEMATICS, APPLIED | BANACH-SPACES | MATHEMATICAL PROGRAMS | OPTIMIZATION | OPTIMALITY CONDITIONS | FORMULAS | Economic models | Convolution | Convexity | Vector spaces | Convex analysis | Goal programming

Journal Article

Optimization Methods and Software: GLOBAL OPTIMIZATION, ISSN 1055-6788, 10/2009, Volume 24, Issue 4-5, pp. 485 - 504

This article addresses the generation of strong polyhedral relaxations for nonconvex, quadratically constrained quadratic programs (QCQPs). Using the convex...

convex envelope | cutting plane | global optimization | polyhedral relaxation | nonconvex quadratic programming | Global optimization | Convex envelope | Nonconvex quadratic programming | Cutting plane | Polyhedral relaxation | MATHEMATICS, APPLIED | LAYOUT | SOLVER | COMPUTER SCIENCE, SOFTWARE ENGINEERING | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ENVELOPES | CONVEX | BOUND ALGORITHM | FACETS | DOMAINS | TRILINEAR MONOMIALS

convex envelope | cutting plane | global optimization | polyhedral relaxation | nonconvex quadratic programming | Global optimization | Convex envelope | Nonconvex quadratic programming | Cutting plane | Polyhedral relaxation | MATHEMATICS, APPLIED | LAYOUT | SOLVER | COMPUTER SCIENCE, SOFTWARE ENGINEERING | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ENVELOPES | CONVEX | BOUND ALGORITHM | FACETS | DOMAINS | TRILINEAR MONOMIALS

Journal Article

Proceedings of the American Mathematical Society, ISSN 0002-9939, 10/2013, Volume 141, Issue 10, pp. 3665 - 3672

Given x_0 of a Euclidean space, the two following statements are proven to be equivalent: (i) every convex function f:C\to \mathbb{R}, and (ii) C. In the...

Conical points | Polyhedral points | Linearly accessible points | Closed convex functions | Gale-Klee-Rockafellar theorem | Continuity of convex functions | polyhedral points | MATHEMATICS | MATHEMATICS, APPLIED | closed convex functions | conical points | linearly accessible points | Mathematics | Classical Analysis and ODEs

Conical points | Polyhedral points | Linearly accessible points | Closed convex functions | Gale-Klee-Rockafellar theorem | Continuity of convex functions | polyhedral points | MATHEMATICS | MATHEMATICS, APPLIED | closed convex functions | conical points | linearly accessible points | Mathematics | Classical Analysis and ODEs

Journal Article

Transactions of the American Mathematical Society, ISSN 0002-9947, 10/2011, Volume 363, Issue 10, pp. 5481 - 5536

In a special case, our theorem is equivalent to the existence of a circle pattern on the torus, with prescribed combinatorics and intersection angles. This is...

Triangulation | Mathematical theorems | Bricks | Critical points | Triangles | Polyhedrons | Curvature | Vertices | Mathematical cusps | Polygons | Circle pattern | Hyperbolic cusp | Convex polyhedral boundary | Rivin-hodgson theorem | Gauss image | MATHEMATICS | Rivin-Hodgson theorem | THEOREM | METRICS | VOLUME | convex polyhedral boundary | circle pattern | CONSTANT CURVATURE | SURFACES | Differential Geometry | Mathematics

Triangulation | Mathematical theorems | Bricks | Critical points | Triangles | Polyhedrons | Curvature | Vertices | Mathematical cusps | Polygons | Circle pattern | Hyperbolic cusp | Convex polyhedral boundary | Rivin-hodgson theorem | Gauss image | MATHEMATICS | Rivin-Hodgson theorem | THEOREM | METRICS | VOLUME | convex polyhedral boundary | circle pattern | CONSTANT CURVATURE | SURFACES | Differential Geometry | Mathematics

Journal Article

Journal of Global Optimization, ISSN 0925-5001, 8/2016, Volume 65, Issue 4, pp. 637 - 655

In this paper we discuss how to derive the non polyhedral convex envelopes for some functions, called 1-convex throughout the paper, over boxes. The main...

Non polyhedral convex envelopes | Mathematics | Trivariate functions | Operation Research/Decision Theory | Computer Science, general | Optimization | Real Functions | 1-Convex functions | BRANCH | EXISTENCE | MATHEMATICS, APPLIED | CONCAVE ENVELOPES | SUM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | RELAXATIONS | CONSTRAINED QUADRATIC PROGRAMS | BOUND ALGORITHM | MULTILINEAR FUNCTIONS | Envelopes | Texts | Boxes (containers)

Non polyhedral convex envelopes | Mathematics | Trivariate functions | Operation Research/Decision Theory | Computer Science, general | Optimization | Real Functions | 1-Convex functions | BRANCH | EXISTENCE | MATHEMATICS, APPLIED | CONCAVE ENVELOPES | SUM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | RELAXATIONS | CONSTRAINED QUADRATIC PROGRAMS | BOUND ALGORITHM | MULTILINEAR FUNCTIONS | Envelopes | Texts | Boxes (containers)

Journal Article

Cybernetics and Systems Analysis, ISSN 1060-0396, 2/2018, Volume 54, Issue 1, pp. 99 - 109

The class of combinatorial optimization problems over polyhedral-spherical sets is considered. The results of theory of convex extensions are generalized to...

Processor Architectures | combinatorial optimization | convex extension | Systems Theory, Control | Artificial Intelligence (incl. Robotics) | Software Engineering/Programming and Operating Systems | Mathematics | polyhedral-spherical set | continuous representation | Functions (mathematics) | Markov analysis | Combinatorial analysis | Optimization | Mathematical programming

Processor Architectures | combinatorial optimization | convex extension | Systems Theory, Control | Artificial Intelligence (incl. Robotics) | Software Engineering/Programming and Operating Systems | Mathematics | polyhedral-spherical set | continuous representation | Functions (mathematics) | Markov analysis | Combinatorial analysis | Optimization | Mathematical programming

Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2006, Volume 3855, pp. 111 - 125

Polyhedral analysis infers invariant linear equalities and inequalities of imperative programs. However, the exponential complexity of polyhedral operations...

ABSTRACT DOMAIN | VARIABLES | COMPUTER SCIENCE, THEORY & METHODS | CONVEX POLYHEDRA

ABSTRACT DOMAIN | VARIABLES | COMPUTER SCIENCE, THEORY & METHODS | CONVEX POLYHEDRA

Conference Proceeding

Optimization Letters, ISSN 1862-4472, 6/2008, Volume 2, Issue 3, pp. 363 - 375

Convex envelopes are a very useful tool in global optimization. However finding the exact convex envelope of a function is a difficult task in general. This...

Numerical and Computational Methods | Global optimization | Multilinear functions | Convex envelope | Operations Research/Decision Theory | Mathematics | Numerical and Computational Methods in Engineering | Optimization | Convex analysis | Edge-concavity | MATHEMATICS, APPLIED | EXTENSIONS | ALGORITHM | NONCONVEX PROGRAMS | CONCAVE ENVELOPES | SOLVE | CONVEXIFICATION | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | BOUNDS

Numerical and Computational Methods | Global optimization | Multilinear functions | Convex envelope | Operations Research/Decision Theory | Mathematics | Numerical and Computational Methods in Engineering | Optimization | Convex analysis | Edge-concavity | MATHEMATICS, APPLIED | EXTENSIONS | ALGORITHM | NONCONVEX PROGRAMS | CONCAVE ENVELOPES | SOLVE | CONVEXIFICATION | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | BOUNDS

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 2009, Volume 410, Issue 46, pp. 4672 - 4691

Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission-critical...

Computer-aided verification | Abstract interpretation | Static analysis | VARIABLES | COMPUTER SCIENCE, THEORY & METHODS | CONVEX POLYHEDRA | Arms control | Verification | Software

Computer-aided verification | Abstract interpretation | Static analysis | VARIABLES | COMPUTER SCIENCE, THEORY & METHODS | CONVEX POLYHEDRA | Arms control | Verification | Software

Journal Article

Algorithmica, ISSN 0178-4617, 5/2014, Volume 69, Issue 1, pp. 58 - 77

We describe algorithms to compute edge sequences, a shortest path map, and the Fréchet distance for a convex polyhedral surface. Distances on the surface are...

Convex polyhedral surface | Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Voronoi diagram | Algorithms | Mathematics of Computing | Computer Science | Fréchet distance | Shortest path map | Theory of Computation | Algorithm Analysis and Problem Complexity | Euclidean shortest path | COMPUTER SCIENCE, SOFTWARE ENGINEERING | QUERIES | MATHEMATICS, APPLIED | STAR | POLYTOPE | ALGORITHM | Frechet distance | VORONOI DIAGRAMS | Computer science

Convex polyhedral surface | Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Voronoi diagram | Algorithms | Mathematics of Computing | Computer Science | Fréchet distance | Shortest path map | Theory of Computation | Algorithm Analysis and Problem Complexity | Euclidean shortest path | COMPUTER SCIENCE, SOFTWARE ENGINEERING | QUERIES | MATHEMATICS, APPLIED | STAR | POLYTOPE | ALGORITHM | Frechet distance | VORONOI DIAGRAMS | Computer science

Journal Article