File: geometric_graph.rules

package info (click to toggle)
polymake 3.0r2-2
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 19,752 kB
  • ctags: 30,928
  • sloc: cpp: 151,785; perl: 32,510; ansic: 3,597; java: 2,654; python: 278; makefile: 181; xml: 103; sh: 79
file content (38 lines) | stat: -rw-r--r-- 1,451 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#  Copyright (c) 1997-2015
#  Ewgenij Gawrilow, Michael Joswig (Technische Universitaet Berlin, Germany)
#  http://www.polymake.org
#
#  This program is free software; you can redistribute it and/or modify it
#  under the terms of the GNU General Public License as published by the
#  Free Software Foundation; either version 2, or (at your option) any
#  later version: http://www.gnu.org/licenses/gpl.txt.
#
#  This program is distributed in the hope that it will be useful,
#  but WITHOUT ANY WARRANTY; without even the implied warranty of
#  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
#  GNU General Public License for more details.
#-------------------------------------------------------------------------------

# An undirected graph with given node coordinates and a bounding box.

declare object GeometricGraph<Scalar=Rational> : Graph {

   # The coordinates of the nodes of the graph.
   property COORDINATES : NodeMap<Undirected, Vector<Scalar> > : construct(ADJACENCY);

   # Since a Voronoi polyhedron is unbounded it must be artificially bounded for visualization purposes.
   # Allowed is any set of hyperplanes which makes the projection onto the last d-1 coordinates bounded.
   # By default, these are the vertical facets of a suitably scaled cube.
   property BOUNDING_BOX : Matrix<Scalar>;

}

object GeometricGraph {
    
}

# Local Variables:
# mode: perl
# cperl-indent-level:3
# indent-tabs-mode:nil
# End: