AN ALGORITHM FOR THE COMPUTATION OF SOME DISTANCE FUNCTIONS BETWEEN CONVEX POLYGONS

AN ALGORITHM FOR THE COMPUTATION OF SOME DISTANCE FUNCTIONS BETWEEN CONVEX POLYGONS

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR === Apresenta-se nesta dissertação um novo algoritmo para o cálculo de algumas funções distância entre polígonos convexos, no caso geral em que os polígonos podem se interseptar, cuja complexidade linear de pior caso é melhor do que a...

Full description

Bibliographic Details
Main Author:	SERGIO LIFSCHITZ
Other Authors:	CELSO DA CRUZ CARNEIRO RIBEIRO
Language:	Portuguese
Published:	PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO 1990
Online Access:	http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9412@1 http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9412@2

Similar Items

[en] AN ALGORITHM FOR THE COMPUTATION OF SOME DISTANCE FUNCTIONS BETWEEN CONVEX POLYGONS
by: SERGIO LIFSCHITZ
Published: (2006)

OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS
by: Dmitry I. Danilov, et al.
Published: (2018-07-01)

Non-convex polygons clustering algorithm
by: Kruglikov Alexey, et al.
Published: (2016-01-01)

An algorithm to cover convex polygons by rectangles
by: LIN, YING-MING, et al.
Published: (1986)

Containment of convex polygon
by: GUO, YI-XIANG, et al.
Published: (1987)

On k-convex polygons
by: Aichholzer, Oswin, et al.
Published: (2014)

Finding the minimum vertex distance between two disjoint convex polygons in linear time
by: McKenna, Michael, 1959-
Published: (1983)

The number of distinct distances from a vertex of a convex polygon
by: Gabriel Nivasch, et al.
Published: (2013-03-01)

Nonobtuse triangulations of convex polygons
by: YOU, CAN-YING, et al.
Published: (1992)

Covering convex polygon by rectangles
by: Lai, Jia Hong, et al.
Published: (1996)

Fast one axis convex polygon filling algorithms and architecture
by: XU, CHU-FA, et al.
Published: (1987)

Optimal parallel algorithms for finding the diameter of a convex polygon
by: CHEN,QI-RONG, et al.
Published: (1991)

On partitioning orthogonal polygons into convex quadrilaterals
by: HUANG, JI-FENG, et al.
Published: (1992)

The decomposition of an arbitrary three-dimensional planar polygon into a set of convex polygons.
by: Potts, Jeffrey Hal.
Published: (2012)

Some Properties of Link Distance in a Simple Polygon
by: Chen, En_Chan, et al.
Published: (1997)

Limit Polygons of Convex Domains in the Projective Plane
by: Nie, X.
Published: (2022)

An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points
by: K. R. Wijeweera, et al.
Published: (2021-09-01)

Convex Polygonal Hull for a Pair of Irregular Objects
by: V.M. Dubynskyi, et al.
Published: (2021-06-01)

Optimally sweeping convex polygons with two and three guards
by: Jabbari, Zohreh
Published: (2010)

On the Geometric Median of Convex, Triangular and Other Polygonal Domains
by: P. A. Panov
Published: (2018-12-01)

Optimally sweeping convex polygons with two and three guards
by: Jabbari, Zohreh
Published: (2010)

Illuminating triangles, quadrilaterals and convex polygons with vertex floodlights.
by: Fraiji, Nicolas.
Published: (2009)

Optimally sweeping convex polygons with two and three guards
by: Jabbari, Zohreh
Published: (2010)

Some Parallel Algorithms for polygon Visibility Problems
by: 許芳榮
Published: (1992)

Computational geometry algorithms for X-Y polygons
by: WANG, YI-MIN, et al.
Published: (1986)

The minimum art gallery guarding problem for rectilinear convex polygons
by: LIAO, BEN-CHEN, et al.
Published: (1988)

A study of the shortest path among convex polygonal obstacles
by: HUANG, XU-HONG, et al.
Published: (1987)

Algorithms for Polygon Clipping by a Plane or Polygon
by: Shu-Hsiang Chang, et al.
Published: (2003)

Distance determination algorithms for convex and concave objects
by: Carretero G., Juan Antonio
Published: (2018)

The expected distance between two random points in a polygon
by: Hsu, Arthur C. (Arthur Chia-Min)
Published: (2005)

Sums of Interior Angles of n-Star ConvexPolygons And Related Problems
by: Meng-Han Li, et al.
Published: (2001)

A Bijective Proof from Triangulated Convex Polygons to Binary Trees
by: Lee, Shih-Jen, et al.
Published: (1996)

A greedy heuristic for axial line placement in collections of convex polygons
by: Hagger, Leonard
Published: (2006)

Path Planning for UAV to Cover Multiple Separated Convex Polygonal Regions
by: Junfei Xie, et al.
Published: (2020-01-01)

A new path planning method based on concave polygon convex decomposition and artificial bee colony algorithm
by: Zhaoying Li, et al.
Published: (2020-01-01)

A New Algorithm for Finding the Minimum Distance between Two Convex Hulls
by: Kaown, Dougsoo
Published: (2009)

Linear time algorithms of simple polygon problems in computational geometry
by: WANG, DE-PEN, et al.
Published: (1988)

The α-minimum convex polygon as a relevant tool for isotopic niche statistics
by: Bonnabel, S., et al.
Published: (2021)

Convex partitioning of a polygon into smaller number of pieces with lowest memory consumption
by: K. R. Wijeweera, et al.
Published: (2017-03-01)

Route-Planning Method for Plant Protection Rotor Drones in Convex Polygon Regions
by: Shaoxing Hu, et al.
Published: (2021-03-01)