Nathan Carr

Nathan Carr

Auto-generated profile, based on publicly available information

Nathan Carr

Adobe Research

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 May 2014 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
JVJ. Vanek
J. Vanek
JGJ. A. Garcia Galicia
J. A. Garcia Galicia
Bedrich BenesBedrich Benes
Bedrich Benes
RMR. Měch
R. Měch
NCN. Carr
N. Carr
GMG. S. Miller
G. S. Miller

1 June 2011 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
JAJames Andrews
James Andrews
PJPushkar Joshi
Pushkar Joshi
NCNathan Carr
Nathan Carr

1 December 2015
Verified
Conference Paper
Closed access
SLSiying Liu
Siying Liu
TNTian-Tsong Ng
Tian-Tsong Ng
KSKalyan Sunkavalli
Kalyan Sunkavalli
MDMinh Do
Minh Do
ESEli Shechtman
Eli Shechtman
NCNathan Carr
Nathan Carr
In this work, we investigate the problem of automatically inferring the lattice structure of near-regular textures (NRT) in real-world images. Our technique leverages the PatchMatch algorithm for finding k-nearest-neighbor (kNN) correspondences in an image. We use these kNNs to recover an initial estimate of the 2D wallpaper basis vectors, and seed vertices of the texture lattice. We iteratively expand this lattice by solving an MRF optimization problem. We show that we can discretize the space of good solutions for the MRF using the kNNs, allowing us to efficiently and accurately optimize the MRF energy function using the Particle Belief Propagation algorithm. We demonstrate our technique on a benchmark NRT dataset containing a wide range of images with geometric and photometric variations, and show that our method clearly outperforms the state of the art in terms of both texel detection rate and texel localization score.

2 March 2017 in Computational Visual Media
Verified
Journal Article
Open access
PDF file
YZYixin Zhuang
Yixin Zhuang
HDHang Dou
Hang Dou
NCNathan Carr
Nathan Carr
TJTao Ju
Tao Ju
We present an algorithm for segmenting a mesh into patches whose boundaries are aligned with prominent ridge and valley lines of the shape. Our key insight is that this problem can be formulated as correlation clustering (CC), a graph partitioning problem originating from the data mining community. The formulation lends two unique advantages to our method over existing segmentation methods. First, since CC is non-parametric, our method has few parameters to tune. Second, as CC is governed by edge weights in the graph, our method offers users direct and local control over the segmentation result. Our technical contributions include the construction of the weighted graph on which CC is defined, a strategy for rapidly computing CC on this graph, and an interactive tool for editing the segmentation. Our experiments show that our method produces qualitatively better segmentations than existing methods on a wide range of inputs.

19 July 2024 in ACM Transactions on Graphics
Verified
Journal Article
Open access
YJYiwen Ju
Yiwen Ju
XDXingyi Du
Xingyi Du
QZQingnan Zhou
Qingnan Zhou
NCNathan Carr
Nathan Carr
TJTao Ju
Tao Ju
We present a method for generating a simplicial (e.g., triangular or tetrahedral) grid to enable adaptive discretization of implicit shapes defined by a vector function. Such shapes, which we call implicit complexes, are generalizations of implicit surfaces and useful for representing non-smooth and non-manifold structures. While adaptive grid generation has been extensively studied for polygonizing implicit surfaces, few methods are designed for implicit complexes. Our method can generate adaptive grids for several implicit complexes, including arrangements of implicit surfaces, CSG shapes, material interfaces, and curve networks. Importantly, our method adapts the grid to the geometry of not only the implicit surfaces but also their lower-dimensional intersections. We demonstrate how our method enables efficient and detail-preserving discretization of non-trivial implicit shapes.

1 April 2022 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
YGYanran Guan
Yanran Guan
HLHan Liu
Han Liu
KLKun Liu
Kun Liu
KYKangxue Yin
Kangxue Yin
RHRuizhen Hu
Ruizhen Hu
HZHao Zhang
Hao Zhang
We introduce a modeling tool which can evolve a set of 3D objects in a functionality-aware manner. Our goal is for the evolution to generate large and diverse sets of plausible 3D objects for data augmentation, constrained modeling, as well as open-ended exploration to possibly inspire new designs. Starting with an initial population of 3D objects belonging to one or more functional categories, we evolve the shapes through part recombination to produce generations of hybrids or crossbreeds between parents from the heterogeneous shape collection. Evolutionary selection of offsprings is guided both by a functional plausibility score derived from functionality analysis of shapes in the initial population and user preference, as in a design gallery. Since cross-category hybridization may result in offsprings not belonging to any of the known functional categories, we develop a means for functionality partial matching to evaluate functional plausibility on partial shapes. We show a variety of plausible hybrid shapes generated by our functionality-aware model evolution, which can complement existing datasets as training data and boost the performance of contemporary data-driven segmentation schemes, especially in challenging cases. Our tool supports constrained modeling, allowing users to restrict or steer the model evolution with functionality labels. At the same time, unexpected yet functional object prototypes can emerge during open-ended exploration owing to structure breaking when evolving a heterogeneous collection.