BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
delaunay (7)
base (6)
algorithm (6)
use (6)
graph (6)

Stem triangul$ (all stems)

35 papers:

ICALPICALP-v1-2015-MitchellPSW #algorithm
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains (JSBM, VP, MS, HW), pp. 947–959.
SIGMODSIGMOD-2014-KimHLPY #framework #graph #named #parallel #scalability
OPT: a new framework for overlapped and parallel triangulation in large-scale graphs (JK, WSH, SL, KP, HY), pp. 637–648.
LATALATA-2014-Gysel #algorithm #problem
Minimal Triangulation Algorithms for Perfect Phylogeny Problems (RG), pp. 421–432.
ICPRICPR-2014-Hess-FloresRJ #analysis #multi #nondeterminism
Uncertainty, Baseline, and Noise Analysis for L1 Error-Based Multi-view Triangulation (MHF, SR, KIJ), pp. 4074–4079.
ICPRICPR-2014-RazafindramananaRV #clustering #incremental
Incremental Delaunay Triangulation Construction for Clustering (OR, FR, GV), pp. 1354–1359.
SACSAC-2014-JungSWCP #difference #retrieval
Similar MRI object retrieval based on modified contour to centroid triangulation with arc difference rate (BKJ, SYS, WW, HDC, JKP), pp. 31–32.
ICDARICDAR-2013-RazafindramananaRV #approximate #recognition
Alpha*-Approximated Delaunay Triangulation Based Descriptors for Handwritten Character Recognition (OR, FR, GV), pp. 440–444.
SIGMODSIGMOD-2013-HuTC #graph
Massive graph triangulation (XH, YT, CWC), pp. 325–336.
STOCSTOC-2013-CaputoMSS #algorithm #random
Random lattice triangulations: structure and algorithms (PC, FM, AS, AS), pp. 615–624.
ICPRICPR-2012-YuL #3d #refinement
Genus refinement of a manifold surface reconstructed by sculpting the 3d-Delaunay triangulation of Structure-from-Motion points (SY, ML), pp. 1021–1025.
RTARTA-2012-OostromZ
Triangulation in Rewriting (VvO, HZ), pp. 240–255.
VLDBVLDB-2011-WangZTT10 #graph #on the
On Triangulation-based Dense Neighborhood Graphs Discovery (NW, JZ, KLT, AKHT), pp. 58–68.
HPDCHPDC-2010-DiasBG
CUDA-based triangulations of convolution molecular surfaces (SD, KB, AJPG), pp. 531–540.
CHICHI-2009-JakobsenH #source code #using #visualisation
Fisheyes in the field: using method triangulation to study the adoption and use of a source code visualization (MRJ, KH), pp. 1579–1588.
SEFMSEFM-2008-BalakrishnanG #fault #named
PED: Proof-Guided Error Diagnosis by Triangulation of Program Error Causes (GB, MKG), pp. 268–278.
GT-VMTGT-VMT-2008-Gruner #graph transformation #mobile #network
Graph Transformation Model of a Triangulated Network of Mobile Units (SG).
ICPRICPR-2008-Nordberg #3d #optimisation #performance
Efficient triangulation based on 3D Euclidean optimization (KN), pp. 1–4.
STOCSTOC-2006-Clarkson #using
Building triangulations using epsilon-nets (KLC), pp. 326–335.
STOCSTOC-2006-RemyS #approximate
A quasi-polynomial time approximation scheme for minimum weight triangulation (JR, AS), pp. 316–325.
ICPRICPR-v1-2006-ChenHHH #segmentation #using
Segmentation of Human Body Parts Using Deformable Triangulation (CCC, JWH, YTH, CYH), pp. 355–358.
SIGIRSIGIR-2004-MayfieldM
Triangulation without translation (JM, PM), pp. 490–491.
ICALPICALP-2003-PoulalhonS
Optimal Coding and Sampling of Triangulations (DP, GS), pp. 1080–1094.
ICALPICALP-2001-LiN #generative #performance
Efficient Generation of Plane Triangulations without Repetitions (ZL, SIN), pp. 433–443.
SIGIRSIGIR-2001-GollinsS #information retrieval
Improving Cross Language Information Retrieval with Triangulated Translation (TG, MS), pp. 90–95.
ICPRICPR-v3-2000-LomenieSGC
Morphological Operations on Delaunay Triangulations (NL, GS, LG, NC), pp. 3556–3559.
SACSAC-1998-CappJ #algorithm #problem #search-based
A weight-coded genetic algorithm for the minimum weight triangulation problem (KC, BAJ), pp. 327–331.
SACSAC-1997-Lee
Constructing the constrained Delaunay triangulation on the Intel paragon (FL), pp. 464–467.
ICALPICALP-1995-ParraS #graph #how
How to Use the Minimal Separators of a Graph for its Chordal Triangulation (AP, PS), pp. 123–134.
ICALPICALP-1993-DillencourtS
A Simple Method for Resolving Degeneracies in Delaunay Triangulations (MBD, WDS), pp. 177–188.
STOCSTOC-1992-Goodrich #parallel
Planar Separators and Parallel Polygon Triangulation (Preliminary Version) (MTG), pp. 507–516.
ICALPICALP-1991-BernEY
The Expected Extremes in a Delaunay Triangulation (MWB, DE, FFY), pp. 674–685.
ICALPICALP-1991-ChazelleEGGHSS #using
Ray Shooting in Polygons Using Geodesic Triangulations (BC, HE, MG, LJG, JH, MS, JS), pp. 661–646.
DACDAC-1986-BhaskerS #algorithm #graph #linear
A linear algorithm to find a rectangular dual of a planar triangulated graph (JB, SS), pp. 108–114.
STOCSTOC-1986-SleatorTT #distance #geometry
Rotation Distance, Triangulations, and Hyperbolic Geometry (DDS, RET, WPT), pp. 122–135.
STOCSTOC-1986-TarjanW #algorithm #linear
A Linear-Time Algorithm for Triangulating Simple Polygons (RET, CJVW), pp. 380–388.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.