<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> <!--Rendered using the Haskell Html Library v0.2--> <HTML ><HEAD ><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=UTF-8" ><TITLE >Data.Graph.Inductive.Query.GVD</TITLE ><LINK HREF="haddock.css" REL="stylesheet" TYPE="text/css" ><SCRIPT SRC="haddock-util.js" TYPE="text/javascript" ></SCRIPT ><SCRIPT TYPE="text/javascript" >window.onload = function () {setSynopsis("mini_Data-Graph-Inductive-Query-GVD.html")};</SCRIPT ></HEAD ><BODY ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD CLASS="topbar" ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD ><IMG SRC="haskell_icon.gif" WIDTH="16" HEIGHT="16" ALT=" " ></TD ><TD CLASS="title" >fgl-5.4.2.3: Martin Erwig's Functional Graph Library</TD ><TD CLASS="topbut" ><A HREF="index.html" >Contents</A ></TD ><TD CLASS="topbut" ><A HREF="doc-index.html" >Index</A ></TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="modulebar" ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD ><FONT SIZE="6" >Data.Graph.Inductive.Query.GVD</FONT ></TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="section1" >Description</TD ></TR ><TR ><TD CLASS="doc" >Graph Voronoi Diagram </TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="section1" >Documentation</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><SPAN CLASS="keyword" >type</SPAN > <A NAME="t:Voronoi" ><A NAME="t%3AVoronoi" ></A ></A ><B >Voronoi</B > a = <A HREF="Data-Graph-Inductive-Internal-RootPath.html#t%3ALRTree" >LRTree</A > a</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v:gvdIn" ><A NAME="v%3AgvdIn" ></A ></A ><B >gvdIn</B > :: (<A HREF="Data-Graph-Inductive-Graph.html#t%3ADynGraph" >DynGraph</A > gr, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal" >Real</A > b) => [<A HREF="Data-Graph-Inductive-Graph.html#t%3ANode" >Node</A >] -> gr a b -> <A HREF="Data-Graph-Inductive-Query-GVD.html#t%3AVoronoi" >Voronoi</A > b</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v:gvdOut" ><A NAME="v%3AgvdOut" ></A ></A ><B >gvdOut</B > :: (<A HREF="Data-Graph-Inductive-Graph.html#t%3AGraph" >Graph</A > gr, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal" >Real</A > b) => [<A HREF="Data-Graph-Inductive-Graph.html#t%3ANode" >Node</A >] -> gr a b -> <A HREF="Data-Graph-Inductive-Query-GVD.html#t%3AVoronoi" >Voronoi</A > b</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v:voronoiSet" ><A NAME="v%3AvoronoiSet" ></A ></A ><B >voronoiSet</B > :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal" >Real</A > b => <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode" >Node</A > -> <A HREF="Data-Graph-Inductive-Query-GVD.html#t%3AVoronoi" >Voronoi</A > b -> [<A HREF="Data-Graph-Inductive-Graph.html#t%3ANode" >Node</A >]</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v:nearestNode" ><A NAME="v%3AnearestNode" ></A ></A ><B >nearestNode</B > :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal" >Real</A > b => <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode" >Node</A > -> <A HREF="Data-Graph-Inductive-Query-GVD.html#t%3AVoronoi" >Voronoi</A > b -> <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Maybe.html#t%3AMaybe" >Maybe</A > <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode" >Node</A ></TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v:nearestDist" ><A NAME="v%3AnearestDist" ></A ></A ><B >nearestDist</B > :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal" >Real</A > b => <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode" >Node</A > -> <A HREF="Data-Graph-Inductive-Query-GVD.html#t%3AVoronoi" >Voronoi</A > b -> <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Maybe.html#t%3AMaybe" >Maybe</A > b</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v:nearestPath" ><A NAME="v%3AnearestPath" ></A ></A ><B >nearestPath</B > :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3AReal" >Real</A > b => <A HREF="Data-Graph-Inductive-Graph.html#t%3ANode" >Node</A > -> <A HREF="Data-Graph-Inductive-Query-GVD.html#t%3AVoronoi" >Voronoi</A > b -> <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Maybe.html#t%3AMaybe" >Maybe</A > <A HREF="Data-Graph-Inductive-Graph.html#t%3APath" >Path</A ></TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="botbar" >Produced by <A HREF="http://www.haskell.org/haddock/" >Haddock</A > version 2.6.1</TD ></TR ></TABLE ></BODY ></HTML >