HomeSort by relevance Sort by last modified time
    Searched refs:polygon (Results 1 - 12 of 12) sorted by null

  /external/clang/test/Sema/
flexible-array-init.c 43 struct polygon { struct
47 struct polygon poly = {
  /external/chromium/chrome/browser/ui/views/
dropdown_bar_host.cc 201 // |w| is used to make it easier to create the part of the polygon that curves
210 // This polygon array represents the outline of the background image for the
213 const Path::Point polygon[] = { local
219 // Find the largest x and y value in the polygon.
221 for (size_t i = 0; i < arraysize(polygon); i++) {
222 max_x = std::max(max_x, static_cast<int>(polygon[i].x));
223 max_y = std::max(max_y, static_cast<int>(polygon[i].y));
226 // We then create the polygon and use SetWindowRgn to force the window to draw
228 Path path(polygon, arraysize(polygon));
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/
dot.stg 72 node [fontsize=11, shape = <if(useBox)>polygon,sides=4,peripheries=2<else>doublecircle, fixedsize=true, width=.6<endif>]; <name>
  /external/skia/third_party/glu/libtess/
README 5 General Polygon Tesselation
16 of the polygon are on the "interior". This makes it possible to do
19 - boundary extraction: instead of tesselating the polygon, returns a
107 vertex which follows begins an edge which lies on the polygon boundary
110 in the polygon interior. "edgeFlag" will be called before the first
171 For example, if the polygon lies in an arbitrary plane in 3-space,
213 rule determines which of these regions are inside the polygon.
228 useful for polygon CSG operations (see below).
233 polygon interior and exterior (rather than a tesselation).
262 - Lets the user supply the polygon normal, if known. All input dat
    [all...]
alg-outline 33 1. Find the polygon normal N.
48 A common way to find a polygon normal is to compute the signed area
49 when the polygon is projected along the three coordinate axes. We
85 The advantage of projecting perpendicular to the polygon normal is
104 line with the regions of the polygon. This is just an ordering of the
  /external/chromium/chrome/browser/first_run/
try_chrome_dialog_view.cc 233 static const POINT polygon[] = { local
238 HRGN region = ::CreatePolygonRgn(polygon, arraysize(polygon), WINDING);
  /external/webkit/Source/WebCore/platform/graphics/wx/
GraphicsContextWx.cpp 245 wxPoint* polygon = new wxPoint[npoints];
247 polygon[i] = wxPoint(points[i].x(), points[i].y());
249 m_data->context->DrawPolygon((int)npoints, polygon);
250 delete [] polygon;
  /external/webkit/Source/WebCore/platform/graphics/qt/
GraphicsContextQt.cpp 449 QPolygonF polygon(npoints);
452 polygon[i] = points[i];
459 p->drawConvexPolygon(polygon);
    [all...]
  /external/mesa3d/docs/
MESA_texture_array.spec 46 a polygon. Several examples include:
    [all...]
  /prebuilts/tools/common/jfreechart/
jfreechart-1.0.9.jar 
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar 
org.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jar 

Completed in 2958 milliseconds