cad – SA119

cadview – 2: Running on Windows

Here are two examples of cadview clients running on Windows. The first is simply the earlier gladeui sample built on Windows using MSVC. Headers and libraries for GTK+ (http://www.gtk.org/download/win32.php) need to be installed. A VC++ project ^[1] was created to refer to the gladeui source files. The project is located at /src/msvc/gladeui. No significant changes were made to the gladeui source.

The second example is called winui and talks directly to the Windows API and GDI+. When handling paint events we require an object using which to perform graphics output. In the GTK+ case, I could simply create the cairo_t object within the handler. In case of the Windows API, the output must be performed via an HDC which is passed as a parameter with the WM_PAINT event. In order to accommodate this, cad_gui_view::paint was modified to take a cad_gui_view::graphics_type& as a parameter. winui is located at /src/msvc/winui in the repo.

^ I had to fall back on a handcrafted MSVC build since CMake failed to find GTK+ and Boost on Windows. The MSVC solution can be found at /src/msvc/msvc.sln within the repository. boost::regex (http://www.boostpro.com/download/) headers and libraries need to be installed for both examples.

cadview – 1: Introduction

cadview is a C++ library which provides a cross-platform GUI widget for 2D drafting. Presently, the following features are supported:

Zoom/Pan
Polyline tool
Entering x,y co-ordinates via mouse selection or text entry

Installation

No installation packages are available yet and the executable has to be built from source. cadview depends on the following tools and libraries:

On a Fedora 16/17 machine, you can install the above dependencies as follows:

$ sudo yum install mercurial gcc-c++ gtk2-devel boost-devel cmake

1	$ sudo yum install mercurial gcc-c++ gtk2-devel boost-devel cmake

Obtain the source using Mercurial as follows:

$ hg clone https://code.google.com/p/cadview

1	$ hg clone https://code.google.com/p/cadview

This should place the source in a directory named cadview in your current directory. To build the binaries:

$ cd cadview
$ mkdir build
$ cd build
$ cmake ../src
$ make

$ cd cadview

$ mkdir build

$ cd build

$ cmake ../src

$ make

gladeui is a test application that uses cadview on GTK+. You can run gladeui as follows:

$ cd gladeui
$ ./gladeui

1 2	$ cd gladeui $ ./gladeui

Select File>Polyline to activate the polyline tool. The UI controls are as follows:

Click to add a point to the polyline
A point can also be added by entering an x,y co-ordinate pair in the textbox and hitting <Enter>
Pan by holding down the middle mouse button
Zoom by turning the mouse wheel
Right-click or hit <Esc> to end the polyline

Design Overview

The visible area of the widget – the view – is represented by the cad_gui_view class. cad_gui_view does not interact directly with the underlying GUI but instead depends on a pair of adaptor classes for GUI facilities.

The first adaptor class is the template parameter U of cad_gui_view and provides facilities like getting the position of the mouse cursor (get_mouse_position) and invalidating the view (invalidate). The second adaptor class is the U::graphics_type type. This type provides facilities to draw on screen (draw_polyline, move_to, line_to) and converting between screen and world co-ordinates (device_to_user).

The cad_gtk_adaptor is an implementation of the first adaptor class (the U parameter) using GTK+. cad_cairo_graphics implements the U::graphics_type using cairo. In a similar way, we can create adaptors for other GUI platforms (e.g. cad_windows_adaptor to wrap around Windows API and cad_windows_graphics to talk to an HDC).

template <typename T, typename U> class cad_gui_view {
  U& gui;

public:
  typedef typename U::graphics_type graphics_type;

  // ...

  void paint();
  void mouse_move(int x, int y);
  void mouse_down(Mouse_button button, int x, int y);
  void mouse_up(Mouse_button button, int x, int y);
  
  void device_to_user(point_2d<T>& point);
};

template<typename T> class cad_gtk_adaptor {
  GtkWidget *widget;

public:
  typedef cad_cairo_graphics<T> graphics_type;

  // ...

  void create_graphics(graphics_type *graphics);
  void get_mouse_position(int *x, int *y);

  GtkWidget* get_widget();

  void invalidate();
};


template<typename T> class cad_cairo_graphics {
  cairo_t *cr;
public:
  // ...

  void move_to(const T x, const T y);
  void line_to(const T x, const T y);
  void draw_polyline(const polyline_2d<T>& polyline);
};

template class cad_gui_view {

U& gui;

public:

typedef typename U::graphics_type graphics_type;

// ...

void paint();

void mouse_move(int x, int y);

void mouse_down(Mouse_button button, int x, int y);

void mouse_up(Mouse_button button, int x, int y);

void device_to_user(point_2d& point);

};

template class cad_gtk_adaptor {

GtkWidget *widget;

public:

typedef cad_cairo_graphics graphics_type;

// ...

void create_graphics(graphics_type *graphics);

void get_mouse_position(int *x, int *y);

GtkWidget* get_widget();

void invalidate();

};

template class cad_cairo_graphics {

cairo_t *cr;

public:

// ...

void move_to(const T x, const T y);

void line_to(const T x, const T y);

void draw_polyline(const polyline_2d& polyline);

};

Test if a Point lies inside a Polygon (from CGA FAQ)

The CGA FAQ describes an algorithm to test if a point lies within a polygon. Roughly speaking, you start from the point and travel north. If you cross an odd number of sides, it means that you were within the polygon when you started and vice versa.

The details of the solution can be found in the CGA FAQ linked above. A C++ implementation can be found here: http://code.google.com/p/curve-project/source/browse/trunk/lab/cgafaq/cgafaq.h The function cgafaq::point_in_polygon takes a point and a polygon and returns whether or not the point lies inside the polygon. This is a direct translation of the code from the FAQ.

Disclaimer: This post and the code provided are not endorsed by any of the contributors to the CGA FAQ.

Orientation of Polygons (from CGA FAQ)

The orientation of a polygon tells us if the vertices are ordered clockwise or counter-clockwise as we move along the perimeter. This is determined by calculating the polygon’s signed area which is positive for counter-clockwise orientation and negative for clockwise orientation. A quicker algorithm is to determine the signed area of the triangle formed by the lowest right most vertex and it’s immediate neighbors.

The details of the solution can be found in the CGA FAQ linked above. A C++ implementation can be found here: http://code.google.com/p/curve-project/source/browse/trunk/lab/cgafaq/cgafaq.h The function cgafaq::orientation has two overloads. The first computes orientation for three vertices and the second calculates the orientation of a polygon.

Disclaimer: This post and the code provided are not endorsed by any of the contributors to the CGA FAQ.

Perpendiculars

I often need to construct perpendiculars in my code and found a very elegant solution to this problem in CGAL source.

Given points A(x_a, y_a) and B(x_b, y_b), perpendiculars BB_ccw and BB_cw to the line AB can be constructed at B using either of the following points:

B_ccw(x_b – (y_b – y_a), y_b + (x_b – x_a)) // such that ABB_ccw is oriented counter-clockwise

B_cw(x_b + (y_b – y_a), y_b – (x_b – x_a)) // such that ABB_cw is clockwise.

This follows from the fact that the product of the slopes of perpendicular lines is -1.

Here is code to return either of these points.

#include <cstdio>

struct P2 {
  float x;
  float y;

  P2(float x, float y) : x(x), y(y) {
  }
};

P2 PerpendicularCW(const P2& a, const P2& b){
  return P2(b.x + (b.y - a.y), b.y - (b.x - a.x));
}

P2 PerpendicularCCW(const P2& a, const P2& b){
  return P2(b.x - (b.y - a.y), b.y + (b.x - a.x));
}

int main(){
  P2 a(20, 20), b(80, 60);
  P2 pccw = PerpendicularCCW(a, b);
  P2 pcw = PerpendicularCW(a, b);

  printf("a(%f,%f),b(%f,%f)\n";, a.x, a.y, b.x, b.y);
  printf("pccw(%f,%f)\n", pccw.x, pccw.y);
  printf("pcw(%f,%f)\n", pcw.x, pcw.y);

  return 0;
}

#include

struct P2 {

float x;

float y;

P2(float x, float y) : x(x), y(y) {

}

};

P2 PerpendicularCW(const P2& a, const P2& b){

return P2(b.x + (b.y - a.y), b.y - (b.x - a.x));

}

P2 PerpendicularCCW(const P2& a, const P2& b){

return P2(b.x - (b.y - a.y), b.y + (b.x - a.x));

}

int main(){

P2 a(20, 20), b(80, 60);

P2 pccw = PerpendicularCCW(a, b);

P2 pcw = PerpendicularCW(a, b);

printf("a(%f,%f),b(%f,%f)\n";, a.x, a.y, b.x, b.y);

printf("pccw(%f,%f)\n", pccw.x, pccw.y);

printf("pcw(%f,%f)\n", pcw.x, pcw.y);

return 0;

}

Output:

a(20.000000,20.000000),b(80.000000,60.000000)
pccw(120.000000,0.000000)
pcw(40.000000,120.000000)

a(20.000000,20.000000),b(80.000000,60.000000)

pccw(120.000000,0.000000)

pcw(40.000000,120.000000)