![]() |
![]() |
|
|
![]() |
![]() |
![]() |
Computer graphics
Newsgroup Mesh Generation Robotics ......... |
Fractal | Convex Hull | Voronoi Diagram | Others |
In order to arouse your interest, this page covers a number of interesting
links about computational geometry, such as convex hull, computer graphics,
virtual reality, and robot motion planning.
There is a brief introduction on every topic.
You can simply click the links to open a new window.
Newsgroup of professional computational geometry
Introduction
What
is Fractal Dimension ?
Simple
example similar to lecturer notes
What
is the length of a coastline, or the border of this fern?
Program
You can
make simple fractals, (Digital Cats)
Demonstration & screen
saver
A program for creating
fractal animation (Filmer V2.0 beta)
Aggregation:
Growth Fractal Structures (Center for Polymer Studies)
Fractal
making procedure (Geometric Mappings in Fractals)
Applications and Others
Full
of Fractal Stuff,(Lystad's Fractal Top, Home of JavaQuat)
Introduce some applications
of fractal in computer world, (Interated Systems)
Image Gallery
I
Image Gallery II
Fractal
Cities : A Geometry of Form and Function
FIF
, Stroud's Viewers
Fractal
& simple games, (FP Java Applets)
The Leap Fractal
Game
Introduction
Convex
Combinations, Convex Set, Convex Hull (On-Line Computer Graphics Notes)
Full
illustration of Graham Scan by using pictures (Riot)
Home page for Qhull
COMPUTING
CONSTRAINED DELAUNAY TRIANGULATIONS IN THE PLANE
Program
Both Gift Wrap and Graham
Scan used (CG Drawing Board)
Show
you the Graham's scan algorithm step by step (Riot)
Quick Hull
Convex Hull (Jarvis' March - the most simple - minded algorithm)
Application
Quantitative
Analysis of Tuberculosis (Computer Research and Applications)
Convex
Hulls: Some Algorithms and Applications
Other stuff related to convex
polygon
Simple
linear algorithm for intersecting convex polygons
and
the corresponding
and
the algorithm
Test
whether a point is inside / outside a polygon
Minimum convex decomposition
Minimum convex decomposition
Hausdorff
distance between convex polygon
Introduction
http://www.iko.unit.no/tmp/term/node6.html
A brief explanation of concepts of voronoi diagrams, convex hull in higher dimensions
http://www.diku.dk/~pawel/comp-geom/compgeom.html
Program
VoroGlide,
interactive Voronoi diagrams
Model
Settlement
Selection for Interactive Display, (with java program)
Java program of Voronoi Diagram
Application
Vertical Mapper
(McDonald's Restaurants )
For more
applications of Voronoi (Geometry in Action)
3-D
Drawing and Geometry, (vanishing point)
xn+1 = fa(xn) , fa(x) = ax(1-x), 0<=a<=4(Graphical
Iteration)
Henry
Chasey's Polyhedra Model Collection
The
Uniform Polyhedra Full explanation of
Polyhedra
The
key to make some Polyhedra Euclid
CRYSTALLOGRAPHIC
POLYHEDRA (Java Programs)
Build
Your Own Polyhedra
The Five Regular
Polyhedra
Dynamic
geometry with polyhedra:
Java program
on Tower of Hanoi I
Java program on Tower
of Hanoi II
Planar
Robot Simulator with obstacle avoidance (Java program)
The
shortest path between any two points that avoids a set of polygonal obstacles
(Java program)
An
efficient Algorithm for Euclidean Shortest Paths among Polygonal Obstacles
in the Plane by S. Kapoor, S.N. Maheshwari, J.S.B. Mitche
Delaunay
Triangulations (Java program)
Delaunay
Triangulations (Java program)
The
shortest path between two points in a polygon(Java program)
Minimum weight triangulation
Quadrangulation
of a set of points
Mininum Spanning
Tree
Lecture notes on the web about CG
Basic
introduction to computational geometry
Lecture
notes in computational geometry by Jianer Chen
Lecture
notes in computational geometry by David Mount
Application challenges
to computational geometry article
Newsgroup of professional
computational geometry
Geometry
in Action
Math
archieve
On-Line
Computer Graphics Notes
Bibliography
for Optimization with Sensitivity Analysis