Vladlen Koltun

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
56Interactive furniture layout using interior design guidelines. Paul Merrell, Eric Schkufza, Zeyang Li, Maneesh Agrawala, Vladlen Koltun. ACM Trans. Graph. (30): 87 (2011). Web SearchBibTeXDownload
55Pattern-aware shape deformation using sliding dockers. Martin Bokeloh, Michael Wand, Vladlen Koltun, Hans-Peter Seidel. ACM Trans. Graph. (30): 123 (2011). Web SearchBibTeXDownload
54Joint shape segmentation with linear programming. Qi-Xing Huang, Vladlen Koltun, Leonidas J. Guibas. ACM Trans. Graph. (30): 125 (2011). Web SearchBibTeXDownload
53Metropolis procedural modeling. Jerry O. Talton, Yu Lou, Steve Lesser, Jared Duke, Radomír Mech, Vladlen Koltun. ACM Trans. Graph. (30): 11 (2011). Web SearchBibTeXDownload
52Space-time planning with parameterized locomotion controllers. Sergey Levine, Yongjoon Lee, Vladlen Koltun, Zoran Popovic. ACM Trans. Graph. (30): 23 (2011). Web SearchBibTeXDownload
51Probabilistic reasoning for assembly-based 3D modeling. Siddhartha Chaudhuri, Evangelos Kalogerakis, Leonidas J. Guibas, Vladlen Koltun. ACM Trans. Graph. (30): 35 (2011). Web SearchBibTeXDownload
50Kinetic Stable Delaunay Graphs. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. CoRR (abs/1104.0622) (2011). Web SearchBibTeXDownload
2010
49Computer-generated residential building layouts. Paul Merrell, Eric Schkufza, Vladlen Koltun. ACM Trans. Graph. (29): 181 (2010). Web SearchBibTeXDownload
48Data-driven suggestions for creativity support in 3D modeling. Siddhartha Chaudhuri, Vladlen Koltun. ACM Trans. Graph. (29): 183 (2010). Web SearchBibTeXDownload
47Gesture controllers. Sergey Levine, Philipp Krähenbühl, Sebastian Thrun, Vladlen Koltun. ACM Trans. Graph. (29) (2010). Web SearchBibTeXDownload
46Feature Construction for Inverse Reinforcement Learning. Sergey Levine, Zoran Popovic, Vladlen Koltun. NIPS 2010, 1342-1350. Web SearchBibTeXDownload
45Kinetic stable Delaunay graphs. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. Symposium on Computational Geometry 2010, 127-136. Web SearchBibTeXDownload
2009
44Exploratory modeling with collaborative design spaces. Jerry O. Talton, Daniel Gibson, Lingfeng Yang, Pat Hanrahan, Vladlen Koltun. ACM Trans. Graph. (28) (2009). Web SearchBibTeXDownload
43Real-time prosody-driven synthesis of body language. Sergey Levine, Christian Theobalt, Vladlen Koltun. ACM Trans. Graph. (28) (2009). Web SearchBibTeXDownload
42Smoothed analysis of probabilistic roadmaps. Siddhartha Chaudhuri, Vladlen Koltun. Comput. Geom. (42): 731-747 (2009). Web SearchBibTeXDownload
41On Overlays and Minimization Diagrams. Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (41): 385-397 (2009). Web SearchBibTeXDownload
40Special Section On The Thirty-Ninth Annual ACM Symposium On Theory Of Computing (STOC 2007). Eric Allender, Vladlen Koltun, Maxim Sviridenko. SIAM J. Comput. (39): 978 (2009). Web SearchBibTeXDownload
2007
39Special Section on Foundations of Computer Science. Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola. SIAM J. Comput. (37): 165 (2007). Web SearchBibTeX
38Approximately dominating representatives. Vladlen Koltun, Christos H. Papadimitriou. Theor. Comput. Sci. (371): 148-154 (2007). Web SearchBibTeXDownload
2006
37Efficient algorithms for bichromatic separability. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun. ACM Transactions on Algorithms (2): 209-227 (2006). Web SearchBibTeXDownload
36On the Union of kappa-Round Objects in Three and Four Dimensions. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (36): 511-526 (2006). Web SearchBibTeXDownload
35On overlays and minimization diagrams. Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2006, 395-401. Web SearchBibTeXDownload
2005
34Hardware-Assisted Natural Neighbor Interpolation. Quanfu Fan, Alon Efrat, Vladlen Koltun, Shankar Krishnan, Suresh Venkatasubramanian. ALENEX/ANALCO 2005, 111-120. Cited by 14Web SearchBibTeXDownload
33Matching Polyhedral Terrains Using Overlays of Envelopes. Vladlen Koltun, Carola Wenk. Algorithmica (41): 159-183 (2005). Cited by 4Web SearchBibTeXDownload
32Lines Avoiding Unit Balls in Three Dimensions. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (34): 231-250 (2005). Web SearchBibTeXDownload
31Incidences between Points and Circles in Three and Higher Dimensions. Boris Aronov, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (33): 185-206 (2005). Web SearchBibTeXDownload
30Cutting Triangular Cycles of Lines in Space. Boris Aronov, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (33): 231-247 (2005). Web SearchBibTeXDownload
29Approximately Dominating Representatives. Vladlen Koltun, Christos H. Papadimitriou. ICDT 2005, 204-214. Web SearchBibTeXDownload
28Separability with Outliers. Sariel Har-Peled, Vladlen Koltun. ISAAC 2005, 28-39. Web SearchBibTeXDownload
27Curve-Sensitive Cuttings. Vladlen Koltun, Micha Sharir. SIAM J. Comput. (34): 863-878 (2005). Web SearchBibTeXDownload
26Pianos are not flat: rigid motion planning in three dimensions. Vladlen Koltun. SODA 2005, 505-514. Web SearchBibTeXDownload
25Near-Optimal Pricing in Near-Linear Time. Jason D. Hartline, Vladlen Koltun. WADS 2005, 422-431. Web SearchBibTeXDownload
2004
24Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions. Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (31): 83-124 (2004). Web SearchBibTeXDownload
23Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions. Vladlen Koltun. Discrete & Computational Geometry (31): 435-460 (2004). Web SearchBibTeXDownload
22Ready, Set, Go! The Voronoi diagram of moving points that start from a line. Vladlen Koltun. Inf. Process. Lett. (89): 233-235 (2004). Web SearchBibTeXDownload
21Almost tight upper bounds for vertical decompositions in four dimensions. Vladlen Koltun. J. ACM (51): 699-730 (2004). Web SearchBibTeXDownload
20Efficient algorithms for bichromatic separability. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun. SODA 2004, 682-690. Web SearchBibTeXDownload
19Matching Polyhedral Terrains Using Overlays of Envelopes. Vladlen Koltun, Carola Wenk. SWAT 2004, 114-126. Cited by 4Web SearchBibTeXDownload
18On the union of kapa-round objects. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2004, 383-390. Web SearchBibTeXDownload
17On lines avoiding unit balls in three dimensions. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2004, 36-45. Web SearchBibTeXDownload
2003
16Segment Intersection Searching Problems in General Settings. Vladlen Koltun. Discrete & Computational Geometry (30): 25-44 (2003). Web SearchBibTeXDownload
153-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations. Vladlen Koltun, Micha Sharir. SIAM J. Comput. (32): 616-642 (2003). Web SearchBibTeXDownload
14The Partition Technique for Overlays of Envelopes. Vladlen Koltun, Micha Sharir. SIAM J. Comput. (32): 841-863 (2003). Web SearchBibTeXDownload
13Cutting triangular cycles of lines in space. Boris Aronov, Vladlen Koltun, Micha Sharir. STOC 2003, 547-555. Web SearchBibTeXDownload
12Efficient algorithms for shared camera control. Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg. Symposium on Computational Geometry 2003, 68-77. Web SearchBibTeXDownload
11Curve-sensitive cuttings. Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2003, 136-143. Web SearchBibTeXDownload
2002
10The Partition Technique for Overlays of Envelopes. Vladlen Koltun, Micha Sharir. FOCS 2002, 637. Web SearchBibTeXDownload
9On the overlay of envelopes in four dimensions. Vladlen Koltun, Micha Sharir. SODA 2002, 810-819. Web SearchBibTeXDownload
8Polyhedral Voronoi diagrams of polyhedra in three dimensions. Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2002, 227-236. Web SearchBibTeXDownload
7Incidences between points and circles in three and higher dimensions. Boris Aronov, Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2002, 116-122. Web SearchBibTeXDownload
6Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations. Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2002, 217-226. Web SearchBibTeXDownload
2001
5Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions. Vladlen Koltun. FOCS 2001, 56-65. Web SearchBibTeXDownload
4Hardware-Accelerated from-Region Visibility Using a Dual Ray Space. Vladlen Koltun, Yiorgos Chrysanthou, Daniel Cohen-Or. Rendering Techniques 2001, 205-216. Web SearchBibTeX
3Segment intersection searching problems in general settings. Vladlen Koltun. Symposium on Computational Geometry 2001, 197-206. Web SearchBibTeXDownload
2Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions. Vladlen Koltun. WADS 2001, 99-110. Web SearchBibTeXDownload
2000
1Virtual Occluders: An Efficient Intermediate PVS Representation. Vladlen Koltun, Yiorgos Chrysanthou, Daniel Cohen-Or. Rendering Techniques 2000, 59-70. Web SearchBibTeX
from DBLP and Google Scholar
References
1. ^ Computer Science Colloquium - NYU Computer Science Department - Retrieved 2011-04-23 - details
2. ^ 2002-2003 Research Colloquia - Retrieved 2011-04-28 - details
3. ^ Vladlen Koltun - Abstract, Department of Computer Science - Retrieved 2010-09-24 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research