These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
112 related articles for article (PubMed ID: 33788688)
1. Deterministic Linear Time Constrained Triangulation Using Simplified Earcut. Livesu M; Cherchi G; Scateni R; Attene M IEEE Trans Vis Comput Graph; 2022 Dec; 28(12):5172-5177. PubMed ID: 33788688 [TBL] [Abstract][Full Text] [Related]
2. Generation of simple polygons from ordered points using an iterative insertion algorithm. Zhang H; Zhao Q; Li Y PLoS One; 2020; 15(3):e0230342. PubMed ID: 32168363 [TBL] [Abstract][Full Text] [Related]
3. Variable Density Filling Algorithm Based on Delaunay Triangulation. Qiao Y; Lv N; Ouyang X Micromachines (Basel); 2022 Aug; 13(8):. PubMed ID: 36014184 [TBL] [Abstract][Full Text] [Related]
6. Perceptually stable regions for arbitrary polygons. Rocha J IEEE Trans Syst Man Cybern B Cybern; 2003; 33(1):165-71. PubMed ID: 18238168 [TBL] [Abstract][Full Text] [Related]
7. Stereo matching and view interpolation based on image domain triangulation. Fickel GP; Jung CR; Malzbender T; Samadani R; Culbertson B IEEE Trans Image Process; 2013 Sep; 22(9):3353-65. PubMed ID: 23715604 [TBL] [Abstract][Full Text] [Related]
19. Digital convexity, straightness, and convex polygons. Kim CE IEEE Trans Pattern Anal Mach Intell; 1982 Jun; 4(6):618-26. PubMed ID: 22499636 [TBL] [Abstract][Full Text] [Related]
20. EL-REP: A New 2D Geometric Decomposition Scheme and Its Applications. Rueda AJ; Feito FR IEEE Trans Vis Comput Graph; 2011 Sep; 17(9):1325-36. PubMed ID: 21041872 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]