[引用][C] Computational geometry in C
J O'Rourke - 1998 - books.google.com
This is the newly revised and expanded edition of the popular introduction to the design and
implementation of geometry algorithms arising in areas such as computer graphics, robotics …
implementation of geometry algorithms arising in areas such as computer graphics, robotics …
Individual‐level trait diversity concepts and indices to comprehensively describe community change in multidimensional trait space
Global environmental change can influence ecosystem processes directly or through
changes in the trait composition of natural communities. Traits are individual‐level features …
changes in the trait composition of natural communities. Traits are individual‐level features …
Non-convex onion-peeling using a shape hull algorithm
MJ Fadili, M Melkemi, A Elmoataz - Pattern recognition letters, 2004 - Elsevier
The convex onion-peeling of a set of points is the organization of these points into a
sequence of interpolating convex polygons. This method is adequate to detect the shape of …
sequence of interpolating convex polygons. This method is adequate to detect the shape of …
[HTML][HTML] On polyhedra induced by point sets in space
PK Agarwal, F Hurtado, GT Toussaint, J Trias - Discrete Applied …, 2008 - Elsevier
Given a set S of n⩾ 3 points in the plane (not all on a line) it is well known that it is always
possible to polygonize S, ie, construct a simple polygon P such that the vertices of P are …
possible to polygonize S, ie, construct a simple polygon P such that the vertices of P are …
Spiral serpentine polygonization of a planar point set
J Iwerks, JSB Mitchell - Computational Geometry: XIV Spanish Meeting on …, 2012 - Springer
LNCS 7579 - Spiral Serpentine Polygonization of a Planar Point Set Page 1 Spiral
Serpentine Polygonization of a Planar Point Set Justin Iwerks and Joseph SB Mitchell Dept …
Serpentine Polygonization of a Planar Point Set Justin Iwerks and Joseph SB Mitchell Dept …
[PDF][PDF] Conectando puntos: poligonizaciones y otros problemas relacionados
M Abellanas - Gaceta de la Real Sociedad Matematica Espanola, 2008 - dmle.icmat.es
Todos hemos jugado alguna vez a conectar los puntos para descubrir la forma que se
ocultaba tras los puntos numerados. A veces la forma era la esperada. Otras el resultado …
ocultaba tras los puntos numerados. A veces la forma era la esperada. Otras el resultado …
[PDF][PDF] On Polyhedra Induced by Point Sets in Space.
F Hurtado, GT Toussaint, J Trias - CCCG, 2003 - cgm.cs.mcgill.ca
Given a set S of n points in the plane (not all on a line) it is well known that it is always
possible to polygonize S, ie, construct a simple polygon P such that the vertices of P are …
possible to polygonize S, ie, construct a simple polygon P such that the vertices of P are …
Ant colony algorithms for multiple objective combinatorial optimization: Applications to the minimum spanning trees problems
PJS Cardoso - 2010 - search.proquest.com
The study of meta-heuristic solutions based on the Ant Colony Optimization (ACO) paradigm
for the Multiple Objective Minimum Spanning Trees and related combinatorial problems is …
for the Multiple Objective Minimum Spanning Trees and related combinatorial problems is …
Combinatorics and complexity in geometric visibility problems
JG Iwerks - 2012 - search.proquest.com
Geometric visibility is fundamental to computational geometry and its applications in areas
such as robotics, sensor networks, CAD, and motion planning. We explore combinatorial …
such as robotics, sensor networks, CAD, and motion planning. We explore combinatorial …
[PDF][PDF] A Bibliography of Publications in Information Processing Letters: 1990–1999
NHF Beebe - 2006 - Citeseer
Abstract [BFSV99, Fv97, CCH93a, CLM96, Kam92, Nys96, THS97]. abstraction [CS91a,
RST91]. accelerated [SL97]. access [BCDM97, Cai99, CY97, DF91, Gol99, HR98c, KCK93 …
RST91]. accelerated [SL97]. access [BCDM97, Cai99, CY97, DF91, Gol99, HR98c, KCK93 …