vertices

2016/03/06 codes

varvertIndex=normalIndex;varvertIndex2=vertIndex+1=length){pX=poly.m_vertices[vertIndex2].x;pY=poly.m_vertices
琳姐姐·2016-03-06 22:00

HDU 5636 Shortest Path floyd应用

TotalSubmission(s):643    AcceptedSubmission(s):209ProblemDescriptionThereisapathgraph G=(V,E) with n vertices
FTQOOO·2016-03-06 16:00

HDU 5636 关键点的 floyd 最短路问题

TotalSubmission(s):285    AcceptedSubmission(s):92ProblemDescriptionThereisapathgraph G=(V,E) with n vertices.V
半根毛线·2016-03-05 23:00

Shortest Path(最短路)

  MemoryLimit:131072/131072K(Java/Others)ProblemDescriptionThereisapathgraph G=(V,E)G=(V,E) with nn vertices.Verticesarenumb
handsomecui·2016-03-05 22:00

Android UI效果之绘图篇（二）

canvas.填充颜色(argb和color)Bitmap圆(circle和oval)点(point)线(line)矩形(Rect)图片(Picture)圆角矩形(RoundRect)文本(text)顶点(Vertices
_Hi_xiaoyu·2016-02-23 10:21

Android UI效果之绘图篇（二）:Canvas

canvas.填充颜色(argb和color)Bitmap圆(circle和oval)点(point)线(line)矩形(Rect)图片(Picture)圆角矩形(RoundRect)文本(text)顶点(Vertices
soul_code·2016-02-22 15:00

关于图论的基础概念

图（graph）是由非空有限集合V和集合E组成，记为G=（V，E）；其中V中的元素称为顶点（vertices），E中的元素称为边（edges）；这是相当直观的，易于理解；但是需要注意的是图论的术语在使用上不统一
LeeHolmes·2016-02-20 22:00

cf293E Close Vertices（树分治+BIT）

 E.CloseVerticesYou'vegotaweightedtree,consistingofnvertices.Eachedgehasanon-negativeweight.Thelengthofthepathbetweenanytwoverticesofthetreeisthenumberofedgesinthepath.Theweightofthepathisthetotalweig
hahalidaxin·2016-02-15 14:00

十五、polygon API

HowpolygonsarehandledinternallyThefivebasicpolygonalAPIclassesConstructionHistoryandTweakspolyModifierCmdexamplesplitUVCmdexamplePolyexporterplug-ins用来存储polygon（faces，edges，vertices
Rambo.Wang·2016-02-11 14:00

无向图相关算法基础

之所以要研究图，是因为图在生活中应用比较广泛：无向图图是若干个顶点(Vertices)和边(Edges)相互连接组成的。边仅由两个顶点连接，并且没有方向的图称为无向图。在
lpx15312·2016-01-11 13:00

【翻译】安卓opengl ES教程之二——创建多边形

3D模型是由许多可以被单独操作的小元素（顶点，边，面和多边形）组成的；顶点一个顶点vertex（复数vertices）是3D模型的最小单元。顶点是由两条或者多条边相交形成的点。
tnjin·2015-12-24 22:00

数据结构 — 7.有向图的创建及出入度的计算

【样例输入】33abc aba cb c   【样例输出】a 02b 11c 2 0#include usingnamespacestd; #defineMAX_VERTICES50/*顶点最大数*
PeersLee·2015-11-25 12:00

浅谈算法和数据结构: 十二 无向图相关算法基础

之所以要研究图，是因为图在生活中应用比较广泛： 无向图 图是若干个顶点(Vertices)和
·2015-11-13 22:20

2013年 ACM 有为杯 Problem I （DAG）

That is ,it is formed by a collection of  vertion  of  vertices  and&
·2015-11-13 14:41

hnsd11348tree(并查集)

Problem description A graph consists of a set of vertices and edges between pairs of vertices.
·2015-11-13 06:51

ACM UVa算法题209 Triangular Vertices的解法

有一段时间没有做ACM算法题目了，今天正好有空便随便挑了209题来做做：ACM UVa算法题#209题 这道题有几个要点： 1.   给定坐标系 坐标系很容易定，我采用的是第一个点为(0, 0)点，X方向差别为2个单位，Y方向差别为1个单位，点之间的距离，也就是LEN为1个单位，这样便于计算。注意我用的不是实际长度，而是抽象的单位，这个单位在不同方向上面意义不一样，
·2015-11-13 05:47

B样条的一个问题的试探（续）

 　　有关B样条插值算法正确性反而是在Matlab实现中发现的，以下列出目前插值算法实现代码：function [ new_vertices, new_knots ] = mybspline_insert
·2015-11-13 02:58

POJ 1741 Tree（树的分治）

Description Give a tree with n vertices,each edge has a length(positive integer less than 1001).
·2015-11-13 00:56

解释脚本语言 计算两个向量的夹角度数。

A face always has 3 vertices.
·2015-11-12 20:51

点边同事移除的办法处理。

View Code /*DissolveEdge.ms over comes the problem of leaving the old vertices behind when you remove
·2015-11-12 20:43

HDU4916 Count on the path(树dp??)

这道题的题意其实有点略晦涩，定义f(a,b)为 minimum of vertices not on the path between vertices a and b.
·2015-11-12 19:08

CF 293 E Close Vertices (树的分治+树状数组)

转载请注明出处，谢谢http://blog.csdn.net/ACM_cxlove?viewmode=contents    by---cxlove 题目：给出一棵树，问有多少条路径权值和不大于w，长度不大于l。 http://codeforces.com/contest/293/problem/E 有男人八题很相似，但是多了一个限制。 同样 还是点分治，考
·2015-11-12 18:56

Hello World in GLSL glsl的第一个例子,Hello World

A minimal shader that performs the most basic tasks: transform the vertices and render the primitives
·2015-11-12 17:40

polyop.getVertsByFlag mask: 用法 例子

This method returns a bitarray of the vertices that have specific bits in this flag variable set,
·2015-11-12 16:34

Hdu Binary Tree Traversals

Problem Description         A binary tree is a finite set of vertices
·2015-11-12 16:54

POJ 2914 Minimum Cut【最小割】

Description Given an undirected graph, in which two vertices can be connected by multiple edges, what
·2015-11-12 15:20

USACO3.4.1--Closed Fences

The corners or vertices are each distinct and are listed in counter-cl
·2015-11-12 11:48

Graphs and Minimum Cuts(Karger's Min-Cut Algorithm)

  Graphs      Two ingredients      1. vertices (nodes) v  
·2015-11-11 18:00

05-1. List Components (25)图的基本遍历

代码长度限制 8000 B 判题程序 Standard 作者 CHEN, Yue For a given undirected graph with N vertices
·2015-11-11 18:21

a fast algorithm to compute the area of a polygon

Assume there is a polygon (v1, v2,...vn), where vi, (1<=i<=n) are its vertices.
·2015-11-11 18:39

poj 1470 Closest Common Ancestors LCA

id=1470 Write a program that takes as input a rooted tree and a list of pairs of vertices.
·2015-11-11 14:06

POJ1741 Tree

30000K Total Submissions: 6232   Accepted: 1770 Description Give a tree with n vertices
·2015-11-11 07:35

《基于MFC的OpenGL编程》Part 8 Colors

Flat Shading   When Smooth Shading is specified, the color values are interpolated between vertices
·2015-11-11 03:37

编译一个OpenGL项目（C语言）

交互式计算机图形学》书中附带的示例程序：polygon.c View Code /* polygon modeler */ #define MAX_POLYGONS 8 #define MAX_VERTICES
·2015-11-11 00:23

USACO6.5-Closed Fences：计算几何

The corners or vertices are each distinct and are listed in counter
·2015-11-08 14:31

树链剖分-点的分治（dis[i]+dis[j]<=k的点对数量）

Total Submissions: 10012   Accepted: 3024 Description Give a tree with n vertices
·2015-11-08 14:58

POJ1741--Tree （树的点分治） 求树上距离小于等于k的点对数

30000K Total Submissions: 12276   Accepted: 3886 Description Give a tree with n vertices
·2015-11-07 12:52

HDU (1710)Binary Tree Traversals

A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint
·2015-11-03 22:55

glDrawElement 比 glDrawArray 效率好的原因。

using an index buffer the graphics card can make use of a cache of already transformed (vertex-shaded) vertices
·2015-11-02 16:32

D3DFVF_XYZ和D3DFVF_XYZRHW的区别

DirectX9中如是说：The RHW value, which stands for Reciprocal of Homogeneous W[1], tells Direct3D that the vertices
·2015-11-02 16:28

Split a polyline at the vertices using ArcObjects

Summary This article contains an ArcObjects code sample that demonstrates how to split a polyline at the vertices
·2015-11-02 16:22

codeforces 505B——DFS——Mr. Kitayuta's Colorful Graph

Kitayuta has just bought an undirected graph consisting of n vertices and m edges
·2015-11-02 15:28

Directly Mapping Texels to Pixels

/blogs.msdn.com/jsteed/articles/209220.aspx   When rendering 2D output using pre-transformed vertices
·2015-11-02 13:36

POJ - 1741 Tree

DescriptionGive a tree with n vertices,each edge has a length(positive integer less than 1001).Define
·2015-11-02 12:52

XNA-3D-绘制三角形

一.在3D空间中绘制三角形 1.新建XNA Windows Game项目,添加成员变量: 1: VertexPositionColor[] vertices; 2: VertexBuffer
·2015-11-02 11:11

强连通分量 ZQUOJ 21467&&POJ 2553 The Bottom of a Graph

Let  V  be a nonempty and finite set, its elements being called vertices (or nodes).
·2015-11-02 09:51

hdu 3694 10 福州 现场 E - Fermat Point in Quadrangle 费马点 计算几何 难度:1

of a triangle, also called Torricelli point, is a point such that the total distance from the three vertices
·2015-11-01 14:48

PAT List Components

List Components For a given undirected graph with N vertices and E edges, please list all the connected
·2015-10-31 19:58

Graphs and Minimum Cuts(Karger's Min-Cut Algorithm)

  Graphs      Two ingredients      1. vertices (nodes) v  
·2015-10-31 18:47

《Cracking the Coding Interview》——第7章：数学和概率论——题目2

代码： 1 // 7.2 n ants are standing on the vertices of an n-edge
·2015-10-31 15:58
上一页 2 3 4 5 6 7 8 9 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他