Back to Results
First PageMeta Content
Euclidean plane geometry / Polygon / Dual polyhedron / Non-Euclidean geometry / Projective geometry / Line clipping / Vertex / Binary space partitioning / Dual polygon / Geometry / 3D computer graphics / Polytopes


CCCG 2011, Toronto ON, August 10–12, 2011 Geometry-Free Polygon Splitting Sherif Ghali∗ Abstract
Add to Reading List

Document Date: 2011-08-06 04:11:16


Open Document

File Size: 313,95 KB

Share Result on Facebook

Company

Prentice-Hall / Bernstein / /

Currency

pence / /

/

Facility

University of Waterloo / /

IndustryTerm

Geometry-free geometric computing / software system / geometric computing / present algorithm / combinatorial algorithms / geometric algorithms / appropriate solution / geometric algorithm / polygon splitting algorithm / geometry-free algorithms / combinatorial geometric algorithms / maintainable geometric systems / combinatorial algorithm / concrete algorithm / clipping algorithm / geometry-free algorithm / /

OperatingSystem

L3 / /

Organization

University of Waterloo / /

Person

Graphics Gems / /

Position

editor / straight-forward / real oriented projective plane RT / /

ProgrammingLanguage

C++ / /

Technology

present algorithm / polygon splitting algorithm / purely combinatorial algorithms / combinatorial algorithm / concrete algorithm / BSP algorithms / clipping algorithm / geometric algorithm / 3.2 Algorithm / finished algorithm / purely combinatorial geometric algorithms / splitting algorithm / geometry-free algorithm / same algorithm / geometry-free algorithms / defining a geometric algorithm / /

SocialTag