Rogach

import javax.swing.*;
import java.awt.*;
import java.util.List;
import java.util.ArrayList;
import java.awt.geom.*;
import java.awt.image.BufferedImage;

public class DemoViewer {

    public static void main(String[] args) {

Rogach

WARNING t_filter() results in empty solution set!!
 solution edge: (0.102197, -1.68708)[1](t=1.03479) - (0.0976054, -1.71425)[1](t=1.06218) 
 solution edge: 58[1]{1} -[4]- 59[1]{0}
 s1= LineSite: (0.389014, -0.692829) - (0.386091, -0.691995)(k=-1)
 s2= PointSite: (0.159513, -0.653879)(k=1)
 s3= LineSite: (-0.162121, -0.673332) - (0.42533, -0.6914)
Running solvers again: 
The failing 6 solutions are: 
(0.12838, -0.650985) t=0.031267 k3=1 e_err=0.0614641
 min<t<max=0 s3.in_region=1 region-t=0.492875

Rogach

#include <string>
#include <iostream>

#include <openvoronoi/medial_axis_filter.hpp>
#include <openvoronoi/medial_axis_walk.hpp>
#include <openvoronoi/voronoidiagram.hpp>
#include <openvoronoi/polygon_interior_filter.hpp>
#include <openvoronoi/utility/vd2svg.hpp>
#include <openvoronoi/version.hpp>

Rogach

12.02-335-gaa6b701
find_seed_vertex on f=0
 Face 0: 0(2)-f0-7(2)-f0-1(0)-f0-2(0)-f0-8(2)-f0-
0 h= -2.72236 dist=3apex=(0.159074, -0.227556)
  7 queued (h=-1.31573 )
  8 queued (h=-1.09637 )
  9 queued (h=-0.842597 )
7 marked IN (in_circle) ( -1.31573 )
8 marked IN (in_circle) ( -1.09637 )
9 marked IN (in_circle) ( -0.842597 )

Rogach

package org.rogach.jopenvoronoi;

import java.io.*;
import java.util.*;
import java.awt.geom.Point2D;
import java.awt.Color;

// random polygon generator
// uses space partitioning algorithm, described here: http://www.geometrylab.de/applet-29-en#space
public class RandomPolygon {

Rogach

    ovd::VoronoiDiagram* vd = new ovd::VoronoiDiagram(1,100);

    ovd::Point p0(-0.2567719874411157,-0.4983049800651602);
    ovd::Point p1(0.12205285479992212,-0.640371712930281);
    ovd::Point p2(-0.25972854724944455,-0.5143879072702902);
    ovd::Point p3(-0.34168692840153536,-0.6418861147966213);
    ovd::Point p4(-0.5288215108461576,0.18480346369654843);
    ovd::Point p5(-0.35263585687204546,-0.50735692278175);
    ovd::Point p6(-0.4821854389417177,0.46463421861462373);

Rogach

    ovd::VoronoiDiagram* vd = new ovd::VoronoiDiagram(1,100);

    ovd::Point p0(-0.2567719874411157,-0.4983049800651602);
    ovd::Point p1(0.12205285479992212,-0.640371712930281);
    ovd::Point p2(-0.25972854724944455,-0.5143879072702902);
    ovd::Point p3(-0.34168692840153536,-0.6418861147966213);
    ovd::Point p4(-0.5288215108461576,0.18480346369654843);
    ovd::Point p5(-0.35263585687204546,-0.50735692278175);
    ovd::Point p6(-0.4821854389417177,0.46463421861462373);

Rogach

package dxf.macros

import scala.language.experimental.macros
import scala.reflect.macros.Context
import scala.swing._
import scala.swing.Swing._
import javax.swing._
import javax.swing.tree.DefaultMutableTreeNode

object ShowTree {

Rogach

package dxf.macros

import scala.language.experimental.macros
import scala.reflect.macros.Context
import scala.swing._
import scala.swing.Swing._
import javax.swing._
import javax.swing.tree.DefaultMutableTreeNode

object ShowTree {

Rogach

package scala.slick.compiler

import scala.slick.ast._
import scala.collection.mutable.HashMap

class Declutter extends Phase {
  val name = "declutter"

  def apply(tree: Node, state: CompilationState): Node = {
    val replaced = new HashMap[Symbol, Symbol]