default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlper Üngör
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c25]Yangdi Lyu, Alper Üngör:
A Fast 2-Approximation Algorithm for Guarding Orthogonal Terrains. CCCG 2016: 161-167- [c24]Eyüp Serdar Ayaz, Alper Üngör:
An Iterative Refinement Scheme of Dominating Guards and Witnesses for Art Gallery Problems. CCCG 2016: 168-174 - [i10]Yangdi Lyu, Alper Üngör:
A Fast 2-Approximation Algorithm for Guarding Orthogonal Terrains. CoRR abs/1605.03271 (2016) - 2014
- [c23]Paul Accisano, Alper Üngör:
Approximate Matching of Curves to Point Sets. CCCG 2014 - [i9]Paul Accisano, Alper Üngör:
Matching Curves to Imprecise Point Sets using Fréchet Distance. CoRR abs/1404.4859 (2014) - [i8]Paul Accisano, Alper Üngör:
Finding a Curve in a Point Set. CoRR abs/1405.0762 (2014) - 2012
- [i7]Paul Accisano, Alper Üngör:
Hardness Results on Curve/Point Set Matching with Fréchet Distance. CoRR abs/1211.2030 (2012) - 2011
- [c22]Paul Accisano, Alper Üngör:
Geometric computation with smart pixels. SCG 2011: 285-286
2000 – 2009
- 2009
- [j11]Alper Üngör:
Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations. Comput. Geom. 42(2): 109-118 (2009) - [j10]Hale Erten, Alper Üngör:
Quality Triangulations with Locally Optimal Steiner Points. SIAM J. Sci. Comput. 31(3): 2103-2130 (2009) - [c21]Hale Erten, Alper Üngör, Chunchun Zhao:
Mesh Smoothing Algorithms for Complex Geometric Domains. IMR 2009: 175-193 - [c20]Hale Erten, Alper Üngör:
Computing Triangulations without Small and Large Angles. ISVD 2009: 192-201 - 2007
- [j9]Daniel A. Spielman
, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement: Algorithms and Analyses. Int. J. Comput. Geom. Appl. 17(1): 1-30 (2007) - [c19]Cem Boyaci, Hale Erten, Alper Üngör:
Triangulations Loosing Bundles and Weight. CCCG 2007: 201-204 - [c18]Hale Erten, Alper Üngör:
Computing Acute and Non-obtuse Triangulations. CCCG 2007: 205-208 - [c17]Ravi Jampani, Alper Üngör:
Construction of Sparse Well-spaced Point Sets for Quality Tetrahedralizations. IMR 2007: 63-80 - [c16]Hale Erten, Alper Üngör:
Triangulations with locally optimal Steiner points. Symposium on Geometry Processing 2007: 143-152 - 2006
- [j8]Alper Üngör:
Guest editorial: Thirteenth International Meshing Roundtable special issue. Eng. Comput. 22(2): 59 (2006) - 2005
- [j7]Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör:
Building spacetime meshes over arbitrary spatial domains. Eng. Comput. 20(4): 342-353 (2005) - [j6]Paul Chew, Jason Shepherd, John P. Steinbrenner, Alper Üngör:
Twelfth International Meshing Roundtable special issue. Eng. Comput. 21(1): 1 (2005) - [j5]Paul Chew, Alper Üngör:
Guest editors' foreword. Int. J. Comput. Geom. Appl. 15(1): 1-2 (2005) - [c15]Sariel Har-Peled, Alper Üngör:
A time-optimal delaunay refinement algorithm in two dimensions. SCG 2005: 228-236 - [i6]Alper Üngör:
Quality triangulations made smaller. EuroCG 2005: 5-8 - [i5]Sariel Har-Peled, Alper Üngör:
A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions. CoRR abs/cs/0501007 (2005) - 2004
- [j4]David Eppstein, John M. Sullivan, Alper Üngör:
Tiling space and slabs with acute tetrahedra. Comput. Geom. 27(3): 237-255 (2004) - [c14]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement with Off-Centers. Euro-Par 2004: 812-819 - [c13]Alper Üngör:
O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations. LATIN 2004: 152-161 - [c12]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Time complexity of practical parallel steiner point insertion algorithms. SPAA 2004: 267-268 - [e1]Alper Üngör:
Proceedings of the 13th International Meshing Roundtable, IMR 2004, Williamsburg, Virginia, USA, September 19-22, 2004. 2004 [contents] - 2003
- [c11]Elif Akçali, Alper Üngör:
Approximation Algorithms for Degree-Constrained Bipartite Network Flow. ISCIS 2003: 163-170 - [i4]David Eppstein, John M. Sullivan, Alper Üngör:
Tiling space and slabs with acute tetrahedra. CoRR cs.CG/0302027 (2003) - [i3]Herbert Edelsbrunner, Alper Üngör:
Relaxed Scheduling in Dynamic Skin Triangulation. CoRR cs.CG/0302031 (2003) - 2002
- [b1]Alper Üngör:
Parallel Delaunay Refinement and Space -Time Meshing. University of Illinois Urbana-Champaign, USA, 2002 - [j3]Alper Üngör, Alla Sheffer:
Pitching Tents in Space-Time: Mesh Generation for Discontinuous Galerkin Method. Int. J. Found. Comput. Sci. 13(2): 201-221 (2002) - [c10]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement: Algorithms And Analyses. IMR 2002: 205-217 - [c9]Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör:
Building Space-Time Meshes Over Arbitrary Spatial Domains. IMR 2002: 391-402 - [c8]Herbert Edelsbrunner, Alper Üngör:
Relaxed Scheduling in Dynamic Skin Triangulation. JCDCG 2002: 135-151 - [i2]Jeff Erickson, Damrong Guoy, John M. Sullivan, Alper Üngör:
Building Space-Time Meshes over Arbitrary Spatial Domains. CoRR cs.CG/0206002 (2002) - [i1]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement: Algorithms and Analyses. CoRR cs.CG/0207063 (2002) - 2001
- [j2]Alla Sheffer, Alper Üngör:
Efficient Adaptive Meshing of Parametric Models. J. Comput. Inf. Sci. Eng. 1(4): 366-375 (2001) - [c7]Alper Üngör:
Tiling 3d euclidean space with acute tetrahedra. CCCG 2001: 169-172 - [c6]Alla Sheffer, Alper Üngör:
Efficient adaptive meshing of parametric models. Symposium on Solid Modeling and Applications 2001: 59-70 - 2000
- [c5]Alper Üngör, Alla Sheffer:
Tent-Pitcher: A Meshing Algorithm for Space-Time Discontinuous Galerkin Methods. IMR 2000: 111-122 - [c4]Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington:
Smoothing and cleaning up slivers. STOC 2000: 273-277
1990 – 1999
- 1999
- [j1]Xiang-Yang Li, Shang-Hua Teng, Alper Üngör:
Simultaneous Refinement and Coarsening for Adaptive Meshing. Eng. Comput. 15(3): 280-291 (1999) - [c3]Xiang-Yang Li, Shang-Hua Teng, Alper Üngör:
Biting Spheres in 3D. IMR 1999: 85-95 - [c2]Xiang-Yang Li, Shang-Hua Teng, Alper Üngör:
Biting Ellipses to Generate Anisotropic Mesh. IMR 1999: 97-108 - 1998
- [c1]Xiang-Yang Li, Shang-Hua Teng, Alper Üngör:
Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries. IMR 1998: 201-210
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
